Input
The input is the same as in AllPairsShortestPath Example: Unweighted, Unbounded Graph.
SQL Call
SELECT * FROM AllPairsShortestPath ( ON callers AS Vertices PARTITION BY callerid ON calls AS Edges PARTITION BY callerfrom USING TargetKey ('callerto') EdgeWeight ('calls') MaxDistance (-1) ) AS dt ORDER BY source, target;
Output
source target distance ------ ------ -------- 1 2 10.0 1 3 2.0 1 4 5.0 1 6 3.0 2 4 7.0 2 6 11.0 3 6 1.0 4 6 4.0 5 6 10.0
Download a zip file of all examples and a SQL script file that creates their input tables.