networkx.algorithms.bidirectional_shortest_path¶

networkx.algorithms.bidirectional_shortest_path(G, source, target)[source]¶

Return a list of nodes in a shortest path between source and target.

Parameters:

G : NetworkX graph

source : node label

starting node for path

target : node label

ending node for path

Returns:

path: list

List of nodes in a path from source to target.

Raises:

NetworkXNoPath

If no path exists between source and target.