Tag: dijkstra

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