Input
Input tables are from AllPairsShortestPath Example 1: Unweighted, Unbounded Graph:
- vertices: callers
- edges: calls
SQL Call
SELECT * FROM PageRank ( ON callers AS vertices PARTITION BY callerid ON calls AS edges PARTITION BY callerfrom USING Targetkey ('callerto') EdgeWeight ('calls') Accumulate ('callerid', 'callername') ) AS dt ORDER BY callerid;
Output
callerid | callername | pagerank |
---|---|---|
1 | John | 0.0890114925255936s |
2 | Carla | 0.122657805325077 |
3 | Simon | 0.0957407550854902 |
4 | Celine | 0.144421189008967 |
5 | Winston | 0.0890114925255936 |
6 | Diana | 0.459157265529279 |