Dijkstra's algorithm: Difference between revisions
Content added Content deleted
(Update emacs lisp code) |
m (→{{header|Wren}}: Minor tidy) |
||
| Line 7,223: | Line 7,223: | ||
{{libheader|Wren-sort}} |
{{libheader|Wren-sort}} |
||
{{libheader|Wren-set}} |
{{libheader|Wren-set}} |
||
<syntaxhighlight lang=" |
<syntaxhighlight lang="wren">import "./dynamic" for Tuple |
||
import "/trait" for Comparable |
import "./trait" for Comparable |
||
import "/sort" for Cmp, Sort |
import "./sort" for Cmp, Sort |
||
import "/set" for Set |
import "./set" for Set |
||
var Edge = Tuple.create("Edge", ["v1", "v2", "dist"]) |
var Edge = Tuple.create("Edge", ["v1", "v2", "dist"]) |
||