|
|
@@ -152,9 +152,6 @@ class graph:
|
|
|
while(sum(unvisited)):
|
|
|
# iterate on routers adjacent to curnode
|
|
|
for i in range(0, 5):
|
|
|
- # skip for curnode = rid - 1
|
|
|
- if (curnode == (rid - 1)):
|
|
|
- break
|
|
|
# don't check curnode
|
|
|
if (i == curnode):
|
|
|
continue
|
|
|
@@ -166,7 +163,11 @@ class graph:
|
|
|
continue
|
|
|
result = min((this.sssp[curnode][0] + this.alist[curnode][i]), this.sssp[i][0])
|
|
|
if (result != this.sssp[i][0]):
|
|
|
- this.sssp[i] = (result, this.sssp[curnode][1])
|
|
|
+ # skip for curnode = rid - 1
|
|
|
+ if (curnode == (rid - 1)):
|
|
|
+ this.sssp[i] = (result, this.sssp.[i][1])
|
|
|
+ else:
|
|
|
+ this.sssp[i] = (result, this.sssp[curnode][1])
|
|
|
else:
|
|
|
this.sssp[i] = (result, this.sssp[i][1])
|
|
|
|
tarfeef101