-
Notifications
You must be signed in to change notification settings - Fork 0
/
ShortestPath.py
44 lines (38 loc) · 1.06 KB
/
ShortestPath.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
from collections import deque
class Solution:
def shortestPath(self, A, edges, S):
weight = [float('inf') for _ in range(A+1)]
adj = [[float('inf') for _ in range(A+1)] for _ in range(A+1)]
for i in range(1, A+1):
adj[i][i] = 0
for edge in edges:
u, v, w = edge
adj[u][v] = w
weight[S] = 0
# for v in range(A):
# weight[v] = adj[S][v]
print("weight", weight, "from", S)
que = deque()
que.append(S)
visited = [False for _ in range(A+1)]
visited[S] = True
while que:
u = que.popleft()
print("u", u)
for v in range(1, A+1):
if v == u: continue
if adj[u][v] != float('inf'):
weight[v] = min(weight[v], weight[u]+adj[u][v])
que.append(v)
print("weight", weight)
sol = Solution()
A = 5
edges = [
[1, 2, 2],
[1, 3, 4],
[1, 4, 1],
[4, 3, 2],
[3, 5, 2],
[5, 4, 4]
]
sol.shortestPath(A, edges, 1)