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
ON (SELECT callerid FROM callers
WHERE callerid IN (1, 2)) AS Sources PARTITION BY callerid
USING
TargetKey ('callerto')
MaxDistance (8)
EdgeWeight ('calls')
) AS dt ORDER BY source, target;
Output
source target distance
------ ------ --------
1 3 2.0
1 4 5.0
1 6 3.0
2 4 7.0
Download a zip file of all examples and a SQL script file that creates their input tables from the attachment in the left sidebar.