networkx.algorithms.traversal.breadth_first_search.bfs_successors¶
-
bfs_successors
(G, source)[source]¶ Returns an iterator of successors in breadth-first-search from source.
Parameters: - G (NetworkX graph)
- source (node) – Specify starting node for breadth-first search and return edges in the component reachable from source.
Returns: succ – (node, successors) iterator where successors is the list of successors of the node.
Return type: iterator
Examples
>>> G = nx.path_graph(3) >>> print(dict(nx.bfs_successors(G,0))) {0: [1], 1: [2]} >>> H = nx.Graph() >>> H.add_edges_from([(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (2, 6)]) >>> dict(nx.bfs_successors(H, 0)) {0: [1, 2], 1: [3, 4], 2: [5, 6]}
Notes
Based on http://www.ics.uci.edu/~eppstein/PADS/BFS.py by D. Eppstein, July 2004.