Dijkstra's algorithm: Difference between revisions

m
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
 
extern fn {priority_t : t@ype}
pqueue$inf :
() -<> priority_t
 
implement pqueue$cmp<double> (x, y) = compare (x, y)
1,448

edits