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