Expert · Graphs · 223 of 264
Shortest distances
Roads join n towns (two-way, with lengths). Print the shortest distance from town 1 to every town, or -1 for towns that cannot be reached. Use Dijkstra's algorithm with heapq.
Input: n and m, then m lines "a b length". Output: n distances on one line.
Examples
Input
4 4 1 2 5 1 3 1 3 2 2 2 4 1
Output
0 3 1 4
Input
3 1 1 2 7
Output
0 7 -1
Input
1 0
Output
0
One more test checks other inputs when you press Check.
Stuck? The idea behind graphs
A graph is places (nodes) joined by edges. Keep it as a dictionary of neighbours: graph[a] is the list of nodes next to a.
Breadth-first search, with a queue, finds the shortest path when every step costs the same; Dijkstra's algorithm, with a heap, when steps cost different amounts.
from collections import deque
graph = {1: [2, 3], 2: [4], 3: [4], 4: []}
dist = {1: 0}
queue = deque([1])
while queue:
node = queue.popleft()
for nxt in graph[node]:
if nxt not in dist:
dist[nxt] = dist[node] + 1
queue.append(nxt)
print(dist[4])Watch for: Mark a node as seen when you add it to the queue, not when you take it out, or it is added many times.