-- -*- M2-comint -*- {* hash: 879061625 *} i1 : G = directedGraph( {a,b,c,d,e}, {(a,b),(b,c),(a,c),(a,d),(d,e)}); i2 : allPairsShortestPath(G) o2 = | 0 1 1 1 2 | | infinity 0 1 infinity infinity | | infinity infinity 0 infinity infinity | | infinity infinity infinity 0 1 | | infinity infinity infinity infinity 0 | 5 5 o2 : Matrix RR <--- RR 53 53 i3 : allPairsShortestPath(adjacencyMatrix(G)) o3 = | 0 1 1 1 2 | | infinity 0 1 infinity infinity | | infinity infinity 0 infinity infinity | | infinity infinity infinity 0 1 | | infinity infinity infinity infinity 0 | 5 5 o3 : Matrix RR <--- RR 53 53 i4 : A = matrix({{0,1,3,5},{1/0.,0,1,3},{1/0.,1/0.,0,1},{2,1/0.,1/0.,0}}) o4 = | 0 1 3 5 | | infinity 0 1 3 | | infinity infinity 0 1 | | 2 infinity infinity 0 | 4 4 o4 : Matrix RR <--- RR 53 53 i5 : allPairsShortestPath(A) o5 = | 0 1 2 3 | | 4 0 1 2 | | 3 4 0 1 | | 2 3 4 0 | 4 4 o5 : Matrix RR <--- RR 53 53 i6 :