Graph, BFS & DFS

[ih4cku]

Many problems can be stated in term of paths in the graph constructed using the edges.

[ih4cku]

Graph representation:

• adjacent list
• adjacent matrix

[ih4cku]

BFS and DFS:

• http://cs.stackexchange.com/questions/298/graph-searching-breadth-first-vs-depth-first
• http://stackoverflow.com/questions/3332947/when-is-it-practical-to-use-dfs-vs-bfs

BFS:

• [ ] http://theoryofprogramming.com/2014/12/25/breadth-first-search-algorithm/
• [ ] http://theoryofprogramming.com/breadth-first-search-algorithm-using-cpp-stl/

DFS:

• [ ] http://theoryofprogramming.com/2014/12/26/depth-first-search-algorithm/

and

• recursive implementation
• iterative implementation

http://stackoverflow.com/questions/9201166/iterative-dfs-vs-recursive-dfs-and-different-elements-order http://stackoverflow.com/questions/21508765/how-to-implement-depth-first-search-for-graph-with-non-recursive-aprroach