Traversal

Depth First Search

Search algorithms.

dfs_preorder(G[, source, reverse_graph])	Return list of nodes connected to source in depth-first-search preorder.
dfs_postorder(G[, source, reverse_graph])	Return list of nodes connected to source in depth-first-search postorder.
dfs_predecessor(G[, source, reverse_graph])	Return predecessors of depth-first-search with root at source.
dfs_successor(G[, source, reverse_graph])	Return succesors of depth-first-search with root at source.
dfs_tree(G[, source, reverse_graph])	Return directed graph (tree) of depth-first-search with root at source.