Recursive DFS (call stack)

• The graph is implemented as an adjacency list.
• You can select the starting node of the search.

       A(0)
       |
       B(1) -- D(3)   H(7)
       |    /  |  \  /
       |   /   |   F(5)
       C(2) -- E(4)  \
                      G(6) -- I(8)
			

0 1 2 3 4 5 6 7 8