Traversals 2

You know about BFS and DFS already, but it turns out they are capable of revealing other interesting properties of graphs. We will show how to use these traversals to detect if a graph is bipartite (yet another way….) and find cycles, SCCs, cut edges, and cut nodes.