Shortest Car Journey (Dijkstra)
A network of roads and towns (labelled through ) is laid out as above. Each number represents the time taken, in minutes, for a car to travel across the road.
Use Dijkstra's pathfinder algorithm to find the shortest time a car can travel from town E to town G.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
The route EAFG provides the shortest route - 19 minutes. Here is the pictorial solution, with workings provided in red text :