9.7.6.2. networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length¶

networkx.algorithms.shortest_paths.unweighted.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 : iterator (target, shortest path length) iterator

See also

shortest_path_length

Examples

>>> G = nx.path_graph(5)
>>> length = nx.single_source_shortest_path_length(G, 0)
>>> dict(length)
{0: 0, 1: 1, 2: 2, 3: 3, 4: 4}