bfs_tree¶

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 – An oriented tree
Return type:	NetworkX DiGraph

Examples

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

Notes