th First Search/Traversal (DFS) Algorithm: Set starting vertex of the graph as visited a While the stack is not empty and push it onto the stack Peek at top vertex on the stack If there is an unvisited connection for that ection as visited and push that vertex onto the stack Ese Pop the top vertex off the stack Example 1 -use G as starting vertex: Stack Unvisited Vertices B,C. D,E,F Action Visited Vertices A Begin with vertex GPush G (G) Peek at G (top of stack) Push B (G, B) and visit connection if present otherwise pop Peek at B (top of stack) Push A (G, B, A) and visit connection if G, B C, D, E, F G, B, A Peek at A and visit/pop Push D (G, B, A, D) as needed C,E,F G, B, A, D G, B, A, D, C G, B, A, D, C, F G, B, A, D, C, F, E G, B, A, D, C, F,E Peek at D and visit/pop as needed Push C (G, B, A, D, C) E, F Peek at C and visit/pop as needed Push F (G, B, A, D, C, F)E - Peek at F and visit/pop as needed E (G, B, A, D, C, F, E) ush Peek at E and visit/pop as needed Pop E (G, B, A, D, C,F) Peek at F and visit/pop Peek at C and visit/pop PopF(G,B,A,D,C) Pop C(G, B, A, D) Pop D (G, B,A) G, B, A, D, C, F, E G, B, A, D, C, F, E G, B, A, D, C, F, E G, B, A, D, C, F,E G, B, A, D, C, F, E Peek at D and visit/pop Peek at A and visit/pop Pop A (G,B) Peek at B and visit/pop Pop B(G Peek at G and visit/popPopG(Empty) G, B, A, D, C, F, E