Explorations in Graphs
Pierre Audibert · 2013
This chapter contains sections titled: The two ways of visiting all the vertices of a connected graph Visit to all graph nodes from one node, following depth-first traversal The pedestrian's route Depth-first exploration to determine connected components of the graph Breadth-first traversal Exercises Returning to a depth-first exploration tree Case of directed graphs Appendix: constructing the maze (simplified version)