找到最短路径或最快路径

Question

I'm given a file with 600000 roads that are connected with junctions. I have to make a program that finds the shortest path between 2 junctions. But it also has to be possible to find the fastest path between 2 other junctions. I was thinking of using the BFS-algorithm to solve this problem, but I don't know if that's the right way to go. I also found some other links that use Dijkstra's algorithm to solve this problem.

I'm not looking for a complete code mashup, but I just want to know if I'm heading in the right direction.

PS: The input files look like this:

4370 6701 3079 2019 60
32840 9113 17817 7483 30
40758 13107 3445 2505 30
3074 11089 19209 2960 40

...

In the following format: Roadnumber - Start junction - End junction - Distance (in meters) - Speed limit (in km/h)

EDIT (for future reference): I decided to use Dijkstra's algorithm to solve this problem and it worked like a charm. Thank you very much everyone! Turns out it only takes a few seconds to find the shortest path between 2 nodes in a graph of over 600000 nodes.

Answer 1

Dijkstra is the good way to go here. You just need to select a proper weight for the edges to represent distance and time...but that is really simple.