Jump to content

Dijkstra's algorithm: Difference between revisions

m
→‎{{header|11l}}: named tuples
m (→‎{{header|11l}}: named tuples)
 
Line 144:
{{trans|Python}}
 
<syntaxhighlight lang="11l">T Edge = (String start, String end, Int cost)
String start
String end
Int cost
 
F (start, end, cost)
.start = start
.end = end
.cost = cost
 
T Graph
1,481

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.