Breadth First Search/Traversal (DFS) Algorithm Set starting vertex as visited and enqueue it into the queue While the queue is not empty Dequeue the next vertex and set it as the current vertex While there is an unvisited connected vertex of the current vertex Mark unvisited vertex as visited and enqueue it into the queue Example 1- use F as starting vertex: Current Vertex Queue Unvisited Vertices Visited Vertices F Enqueue F Dequeue Enqueue C Enqueue E EnqueueG A, B, C.D,E.G C, E C, E, G E, G E, G, B E, G, B, D G, B, D A, B, C,D,E,GF A, B, D, E,G A B,D,G A, B, D A,B.D A, D F, C F, C, E F. C,E,G F, C, E, G F.C,E,G,B F.C, E, G, B, D F, C, E, G, B, D Dequeue Enqueue B Enqueue D DequeueE E (no new connections) G (no new connections) Dequeue G B, D F, C, E, G, B, D Dequeue B Enqueue A Dequeue DequeueA F, C, E, G, B, D F. C, E. G, B, D, A F.C,E. G. B.D,A F.C.E.G.B.D A D, A Empty