This documents the development version of NetworkX. Documentation for the current release can be found here.
single_target_shortest_path(G, target, cutoff=None)¶
Compute shortest path to target from all nodes that reach target.
- GNetworkX graph
- targetnode label
Target node for path
- cutoffinteger, optional
Depth to stop the search. Only paths of length <= cutoff are returned.
Dictionary, keyed by target, of shortest paths.
The shortest path is not necessarily unique. So there can be multiple paths between the source and each target node, all of which have the same ‘shortest’ length. For each target node, this function returns only one of those paths.
>>> G = nx.path_graph(5, create_using=nx.DiGraph()) >>> path = nx.single_target_shortest_path(G, 4) >>> path [0, 1, 2, 3, 4]