9.11.2.2. networkx.algorithms.traversal.breadth_first_search.bfs_tree¶

networkx.algorithms.traversal.breadth_first_search.bfs_tree(G, source, reverse=False)[source]¶

Return an oriented tree constructed from of a breadth-first-search starting at source.

Parameters:	G : NetworkX graph source : node Specify starting node for breadth-first search and return edges in the component reachable from source. reverse : bool, optional If True traverse a directed graph in the reverse direction
Returns:	T: NetworkX DiGraph An oriented tree

Notes

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

Examples

>>> G = nx.path_graph(3)
>>> print(list(nx.bfs_edges(G,0)))
[(0, 1), (1, 2)]