networkx.bidirectional_dijkstra
networkx.dijkstra_predecessor_and_distance
Enter search terms or a module, class or function name.
Return a list of nodes in a shortest path between source and target.
Also known as shortest_path()
G : NetworkX graph
source : node label
starting node for path
target : node label
ending node for path