##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Dry Run
Graph: , , . Start dfs():
Mark . List: {, }.
Go to .
Call dfs(). Mark . List: {, }. Neighbor is visited. Skip. Neighbor is not. Call dfs(). Mark . List: {}. Neighbor is visited. Skip. Done. Return to dfs(). dfs() Done. Return to dfs().
Back at .
Next neighbor is . Call dfs(). Path: .
