networkx.bidirectional_shortest_path

bidirectional_shortest_path(G, source, target)

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.

See also

shortest_path

Notes

This algorithm is used by shortest_path(G,source,target).