RosettaCodeData/Task/Floyd-Warshall-algorithm/J/floyd-warshall-algorithm-5.j

15 lines
284 B
Plaintext

task graph
pair dist path
1->2 _1 1->3->4->2
1->3 _2 1->3
1->4 0 1->3->4
2->1 4 2->1
2->3 2 2->1->3
2->4 4 2->1->3->4
3->1 5 3->4->2->1
3->2 1 3->4->2
3->4 2 3->4
4->1 3 4->2->1
4->2 _1 4->2
4->3 1 4->2->1->3