Talk:Dijkstra's algorithm: Difference between revisions

Content added Content deleted

Inline

@@ Line 190: / Line 190: @@
         q.add(source);
-        // set-up vertices
-        for (Vertex v : graph.values()) {
-            v.previous = v == source ? source : null;
-            v.dist = v == source ? 0 : Integer.MAX_VALUE;
-            q.add(v);
-        }
         dijkstra(q);