Question

Can someone help me with this algorithmic question.

Suppose BFS algorithm is run on the graph, where every edge length is 1, starting at node A: (a) Draw the procedure of BFS; (b) Show the final shortest-path tree.).

4 2 4

Answer 1

BFS algorith is run on the graph,

length is 1 in every edge

Procedure:

Queue:

• A
• E, F, B
• F, B
• F, B
• G, C
• C, H
• H, D
• D
• (Empty)

?Operations:

• Push A
• Pop A. Push E, F, B
• Pop E (No push as no unvisited adjacent node)
• Pop F (No push as no unvisited adjacent node)
• Pop B. Push G, C
• Pop G. Push H
• Pop C. Push D
• Pop H (No push as no unvisited adjacent node)
• Pop D (No push as no unvisited adjacent node)

Order Visit : A - > E - > F - > B - > G - > C - > H - > D

BFS Tree