BREADTH FIRST SEARCH GRAPH TRAVERSING BY PROF UZAIR

BREADTH FIRST SEARCH GRAPH TRAVERSING BY PROF. UZAIR SALMAN

ALGORITHM • Step 1: Define a Queue of size total number of vertices in the graph. • Step 2: Select any vertex as starting point for traversal. Visit that vertex and insert it into the Queue. • Step 3: Visit all the adjacent vertices of the vertex which is at front of the Queue which is not visited and insert them into the Queue. • Step 4: When there is no new vertex to be visit from the vertex at front of the Queue then delete that vertex from the Queue. • Step 5: Repeat step 3 and 4 until queue becomes empty. • Step 6: When queue becomes Empty, then produce final spanning tree by removing unused edges from the graph

BFS: Consider following Graph ENQUE() B D DEQUE() A C E G F

BFS: Consider following Graph ENQUE() B D T EN RR CU DEQUE() A C E OUTPUT: G F A

ENQUE() B D B T EN RR CU DEQUE() A C E OUTPUT: G F A B

ENQUE() B D G B T EN RR CU DEQUE() A C E OUTPUT: G F A B G

RR CU T EN ENQUE() B D G B DEQUE() A C E OUTPUT: G F A B G

ENQUE() B D G DEQUE() A C E OUTPUT: G T CU EN RR F A B G

ENQUE() B D C DEQUE() A C E OUTPUT: G T CU EN RR F A B G C

ENQUE() B D F C DEQUE() A C E OUTPUT: G T CU EN RR F A B G CF

ENQUE() B D F C RR CU T EN DEQUE() A C E OUTPUT: G F A B G CF

ENQUE() B D D F RR CU T EN DEQUE() A C E OUTPUT: G F A B G C FD

ENQUE() B D E D F RR CU T EN DEQUE() A C E OUTPUT: G F A B G C FDE

ENQUE() B D E D F DEQUE() A E C T EN RR CU OUTPUT: G F A B G C FDE

CU RR B ENQUE() EN T D E D DEQUE() A C E OUTPUT: G F A B G C FDE

ENQUE() B D E CU DEQUE() RR A C EN T E OUTPUT: G F A B G C FDE

ENQUE() B D TY P E EM U QUE DEQUE() A C E OUTPUT: G F A B G C FDE