Floyd-Warshall algorithm: Difference between revisions

=={{header|Mathematica}} / {{header|Wolfram Language}}==

<lang Mathematica>g = Graph[{1 \[DirectedEdge] 3, 3 \[DirectedEdge] 4,

4 \[DirectedEdge] 2, 2 \[DirectedEdge] 1, 2 \[DirectedEdge] 3},

EdgeWeight -> {(1 \[DirectedEdge] 3) -> -2, (3 \[DirectedEdge] 4) ->

2, (4 \[DirectedEdge] 2) -> -1, (2 \[DirectedEdge] 1) ->

4, (2 \[DirectedEdge] 3) -> 3}]

vl = VertexList[g];

dm = GraphDistanceMatrix[g];

Grid[LexicographicSort[

DeleteCases[

Catenate[

Table[{vl[[i]], vl[[j]], dm[[i, j]]}, {i, Length[vl]}, {j,

Length[vl]}]], {x_, x_, _}]]]</lang>

{{out}}

<pre>1 2 -1.

1 3 -2.

1 4 0.

2 1 4.

2 3 2.

2 4 4.

3 1 5.

3 2 1.

3 4 2.

4 1 3.

4 2 -1.

4 3 1.</pre>