Module search

Search algorithms.

See also networkx.path.

Date:

Author: Eben Kenah (ekenah@t7.lanl.gov) Aric Hagberg (hagberg@lanl.gov)

Functions

dfs_preorder(G, source=None, reverse_graph=False)
Return list of nodes connected to source in DFS preorder.

source code

dfs_postorder(G, source=None, reverse_graph=False)
Return list of nodes connected to source in DFS preorder.

source code

dfs_tree(G, source=None, reverse_graph=False)
Return directed graph (tree) of depth-first-search with root at source.

source code

dfs_predecessor(G, source=None, reverse_graph=False)
Return predecessors of depth-first-search with root at source.

source code

dfs_successor(G, source=None, reverse_graph=False)
Return succesors of depth-first-search with root at source.

source code

_test_suite()

source code

Variables

__revision__ = ''

Function Details

Return list of nodes connected to source in DFS preorder. Traverse the graph G with depth-first-search from source. Non-recursive algorithm.

Return list of nodes connected to source in DFS preorder. Traverse the graph G with depth-first-search from source. Non-recursive algorithm.

Return directed graph (tree) of depth-first-search with root at source. If the graph is disconnected, return a disconnected graph (forest).