networkx.algorithms.dfs_successors¶

networkx.algorithms.dfs_successors(G, source=None)[source]¶

Return dictionary of successors in depth-first-search from source.

Parameters:	G : NetworkX graph source : node, optional Specify starting node for depth-first search and return edges in the component reachable from source.
Returns:	succ: dict A dictionary with nodes as keys and list of successor nodes as values.

Notes

Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July 2004.

If a source is not specified then a source is chosen arbitrarily and repeatedly until all components in the graph are searched.

Examples

>>> G = nx.path_graph(3)
>>> print(nx.dfs_successors(G,0))
{0: [1], 1: [2]}