Shortest Car Journey (Dijkstra)

Computer Science Level pending

A network of roads and towns (labelled \(A\) through \(I\)) 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.

×

Problem Loading...

Note Loading...

Set Loading...