bidirectional_shortest_path#
- bidirectional_shortest_path(G, source, target)[source]#
Returns a list of nodes in a shortest path between source and target.
- Parameters
- GNetworkX graph
- sourcenode label
starting node for path
- targetnode 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.
See also
shortest_path
Notes
This algorithm is used by shortest_path(G, source, target).