Python: How to find if a path exists between 2 nodes in a graph?

Question

I am using networkx package of Python.

Answer 1

• dijkstra_path(G, source, target)

  Returns the shortest path from source to target in a weighted graph G.