Dijkstra's algorithm: Difference between revisions
m
→{{header|ATS}}
m (→{{header|ATS}}) |
|||
Line 752:
Shortest path from 'a' to 'f': a -> c -> f</pre>
=== Heading text ===
=={{header|ATS}}==
Line 804 ⟶ 805:
pqueue$cmp :
(priority_t, priority_t) -<> int
implement pqueue$cmp<double> (x, y) = compare (x, y)
|