networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length¶
-
single_source_shortest_path_length
(G, source, cutoff=None)[source]¶ Compute the shortest path lengths from source to all reachable nodes.
Parameters: - G (NetworkX graph)
- source (node) – Starting node for path
- cutoff (integer, optional) – Depth to stop the search. Only paths of length <= cutoff are returned.
Returns: lengths – Dict keyed by node to shortest path length to source.
Return type: Examples
>>> G = nx.path_graph(5) >>> length = nx.single_source_shortest_path_length(G, 0) >>> length[4] 4 >>> for node in length: ... print('{}: {}'.format(node, length[node])) 0: 0 1: 1 2: 2 3: 3 4: 4
See also
shortest_path_length()