Round 1: Maniac Moving - partial 2

TODO: move to Dijkstra

2017.1-RoundOne/c.ManiacMoving.py

@@ -1,16 +1,19 @@
 import numpy as np
 
 def shortest(i, j, ABG):
-    minis = {}
-    for A, B, G in ABG:
-        if A != i and B != i:
-            continue
-        if A == i:
-            x = B
-        else:
-            x = A
-        if x not in minis or minis[x] > G:
-            minis[x] = G
+    visited = {}
+    level = 0
+    while True:
+        L[level] = {}
+        for A, B, G in ABG:
+            if A != i and B != i:
+                continue
+            if A == i:
+                x = B
+            else:
+                x = A
+            if x not in L[level] or L[level][x] > G:
+                L[level][x] = G
     direct = -1
     if j in minis:
         direct = minis[j]