Jump to content

Floyd-Warshall algorithm: Difference between revisions

Line 2,744:
 
 
This implementation was written by referring frequently to [[#ATS|the ATS]], but differs from it considerably. For example, it assumes IEEE floating point, whereas the ATS purposely avoided that assumption. However, the "square matrix" typeand is"edge" types are very similar to the ATS equivalentequivalents.
 
 
<lang ocaml>(*
Line 2,974 ⟶ 2,973:
4 -> 2 -1.0 4 -> 2
4 -> 3 1.0 4 -> 2 -> 1 -> 3</pre>
 
 
 
 
=={{header|Perl}}==
1,448

edits

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