quetions 2013年12月19日23:00:56

1 = adjacent array BFS and dfs

2 = the dfs via a stack

3 = understanding the return behavior in the dfs;

5 = question : how to print out the path; ?

4 = the time complexity of BFS and DFS

6 = how to find a circle in one graph when TC is v+e