finish all analysis

codes/core/dijkstra/pure_dijkstra.py

@@ -1,25 +1,22 @@
-def pure_dijkstra(nodes, adj, start, end):
+def pure_dijkstra(nodes, adj, start):
     dist = [float('inf')] * nodes
     dist[start] = 0
     visited = [False] * nodes
 
     cur = start
-    
+
     while True:
         if cur == -1:
             break
 
-        if cur == end:
-            break
-
         for next, d in adj[cur]:
             if not visited[next]:
                 new = dist[cur] + d
                 if new < dist[next]:
                     dist[next] = new
-        
+
         visited[cur] = True
-        
+
         # Finding min node
         min_node = -1
         min_val = float('inf')
@@ -28,5 +25,5 @@ def pure_dijkstra(nodes, adj, start, end):
                 min_node = n
                 min_val = dist[n]
         cur = min_node
-    
-    return dist[end]
+
+    return dist