Return dictionary of successors in breadth-first-search from source.
Parameters: | G : NetworkX graph source : node, optional
|
---|---|
Returns: | succ: dict :
|
Notes
Based on http://www.ics.uci.edu/~eppstein/PADS/BFS.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.Graph()
>>> G.add_path([0,1,2])
>>> print(nx.bfs_successors(G,0))
{0: [1], 1: [2]}