Question

Resource: Ch. 10, "Graphs", of Data Structures: Abstraction and Design Using Java, Exercises for Section 10.4; Self-Check #1

Complete the Self-Check Question #1 within "Exercises for Sections 10.4" subsection in Section 10.4, "Traversals of Graphs" of Ch. 10, "Graphs" in Data Structures: Abstraction and Design Using Java.

Document the breadth-first search trees in the Self-Check question.

Submit the assignment to the Assignment Files tab.

4. Show the breadth-first search trees for the following graphs.

2 1 3 0 4

Answer 1

Since the problem statement prior to problem 4 is incomplete, I cannot possibly answer it.

Hence, in this post, I am answering the problem 4.

Please find the BFS algorithm below.

BFS is a traversing algorithm where you should start traversing from a selected node (source or starting node) and traverse the graph layer wise thus exploring the neighbour nodes (nodes which are directly connected to source node). You must then move towards the next-level neighbour nodes.

As the name BFS suggests, you are required to traverse the graph breadthwise as follows:

1. First move horizontally and visit all the nodes of the current layer
2. Move to the next layer

4. a)

The BFS for this graph is given below considering 0 as the start node:

0 -> 1 -> 4 -> 2 -> 3

4. b)

The BFS for this graph is given below considering A as the start node:

A -> B -> E -> C -> D