Tag: shortest-path

For Dijkstra’s algorithm, what would be a way to keep track of and store the vertices that each shortest path contains?

algorithm dijkstra priority-queue python shortest-path

I have it coded it out to update all the costs of the edges and such to complete Dijkstra’s main goal of finding the shortest path from the source vertex to all other vertices. But I what I need help on is figuring out a way to store the vertices that each shortest path contains into an array that contains

Find all shortest paths between all pairs of nodes in NetworkX

graph-theory networkx python python-3.x shortest-path

I am trying to get all shortest paths between all pairs of nodes in an undirected unweighted graph. I am currently using nx.all_pairs_shortest_path(), but I don’t understand why it only returns one shortest path for every pair of nodes. There are cycles in my graph so there should exist multiple shortest paths between certain nodes. Any suggestions? Answer I stumbled

How would you find the shortest path from a collection of lists representing train lines?

python shortest-path

So I have four “train lines” represented as lists: Essentially, each letter serves as a “station”. If a station appears on multiple lines, you can transfer from one line to another, similar to many underground city transit systems. For example, the shortest path from “a” to “h” would be [“a”, “b”, “h”] because you can go from “a” to “b”