NetworkX

Previous topic

networkx.bidirectional_dijkstra

Next topic

networkx.dijkstra_predecessor_and_distance

networkx.bidirectional_shortest_path

bidirectional_shortest_path(G, source, target)

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

Also known as shortest_path()

Parameters:

G : NetworkX graph

source : node label

starting node for path

target : node label

ending node for path