Undirected Depth First Search B C G Adjacency Lists A: F C B G B: A C: A D: F E E: G F D F: A E D: G: E A: H: I: I: H: D E F

Undirected Depth First Search B C G D E F newly discovered F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search A already marked B C G D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E newly discovered E E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G G newly discovered G visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search visit(G) (G, E) (G, A) E already marked B C G visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search visit(G) (G, E) (G, A) A already marked B C G visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search Finished G visit(G) (G, E) (G, A) B C G visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search F already marked B C G visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D newly discovered D visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search F already marked visit(D) (D, F) (D, E) B C G visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search E already marked visit(D) (D, F) (D, E) B C G visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search Finished D visit(D) (D, F) (D, E) B C G visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G Finished E visit(E) (E, G) (E, F) (E, D) D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search D already marked B C G D E visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E Finished F visit(F) (F, A) (F, E) (F, D) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search C newly discovered C B C G D E F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search A already marked B C G D E visit(C) (C, A) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E Finished C visit(C) (C, A) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B newly discovered B B C G D E F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search A already marked B C G D E visit(B) (B, A) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E Finished B visit(B) (B, A) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search G already finished B C G D E F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E F Finished A visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E F Undiscovered Marked Active Finished Stack

Undirected Depth First Search I newly discovered I I B C G D E F visit(H) (H, I) Undiscovered Marked Active Finished Stack

Undirected Depth First Search H already marked B C G D E visit(I) (I, H) F visit(H) (H, I) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E Finished I visit(I) (I, H) F visit(H) (H, I) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E F FinishedH visit(H) (H, I) Undiscovered Marked Active Finished Stack

Undirected Depth First Search B C G D E F Undiscovered Marked Active Finished Stack

Layer i: All nodes at distance i from A BFS layers and tree Layer 0 A H Layer 3 B C G D E Layer 1 Layer 2 F Layer i: All nodes at distance i from A

DFS tree A H B C G D E F

Recap BFS tree: F A B C G D E H DFS tree: F A B C G D E H