Dijkstra's algorithm: Difference between revisions

Content added Content deleted
m (→‎{{header|11l}}: named tuples)
 
Line 144: Line 144:
{{trans|Python}}
{{trans|Python}}


<syntaxhighlight lang="11l">T Edge
<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
T Graph