tweaks to dijkstras

diff --git a/examples/dijkstra.dyna b/examples/dijkstra.dyna
index 7c44a526c85d02397e0f2c6109c65e8442eec672..48673db639320a1ea0ad0769094df1d47f3e63b1 100644 (file)
--- a/examples/dijkstra.dyna
+++ b/examples/dijkstra.dyna
@@ -1,13 +1,15 @@
+
+% Dijkstra's algorithm for single-source shortest path
 path(*start) min= 0 .
 path(B) min= path(A) + edge(A,B).
 
 start += "a".
 
-edge("a","b") += 1 . 
-edge("b","d") += 1 . 
-edge("a","d") += 3 . 
-edge("a","c") += 1 . 
-edge("c","d") += 2 . 
+edge("a","b") += 1 .
+edge("b","d") += 1 .
+edge("a","d") += 3 .
+edge("a","c") += 1 .
+edge("c","d") += 2 .
 
 % Expected
 %  path("a") = 0