Dijkstra's algorithm: Difference between revisions

Content deleted Content added

Inline

@@ Line 525: / Line 525: @@
         {"e", "f", 9},
     }
-    directed := false
+    directed := true
     start := "a"
     end := "e"
@@ Line 710: / Line 710: @@
     return r
 }</lang>
+{{out}}
-Output:
 <pre>
-Undirected graph with 6 nodes, 9 edges
+Directed graph with 6 nodes, 9 edges
 Shortest path(s):
-[a c f e] length 20
+[a c d e] length 26
 </pre>