use below queue to solve the question and draw bfs tree based on the DIRECTED graph

directed graph G = (V,E) shown above and assume that the adjacency lists for all vertices are sorted by increasing vertex indices , answer the following

Q1: Solve the BFS (Breadth first search) --> (G, 0) starting with source 0. Show the Queue after each step. Show also d[], p[] lists and BFS tree.

solve as follows :

vertices name	vertices name	vertices name	vertices name	vertices name
0
--------

p[] is parent(precedecssor)

d[] is source or vertix value

show your work with queue dequeue

0 1 2 3 4 5 6 7 8