Given a graph with the distance and time between cities, use Dijkstra's algorithm or greedy approach to find the shortest distance between any city and an end city. Keep it simple, no class or import of any kind.

C4 C3 5.0 km 13 min 7.7 km 21 min C1 5.4 km 10 min C5 12.3 km 20 min C8 4.7 km 15 min 9.5 km 12 min C10 4.9 km 12 min 3.1 km 13 min 11 km 19 min 7.2 km 11 min C-end 4.0 km 9 min 5.3 km 19 min 3.7 km 15 min C11 3.1 km 8 min 2.7 km 10 min 2.7 km 8 min C2 16.8 km 25 min C12 7.5 km 17 min 5.0 km 17 min C7 7.9 km 15 min 5.3 km 15 min C6 C9