Input
The input is the same as in AllPairsShortestPath Example 1: 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 |
| 1 | 3 | 2 |
| 1 | 4 | 5 |
| 1 | 6 | 3 |
| 2 | 4 | 7 |
| 2 | 6 | 11 |
| 3 | 6 | 1 |
| 4 | 6 | 4 |
| 5 | 6 | 10 |