1.0 - 8.00 - AllPairsShortestPath Example 1: Unweighted, Unbounded Graph - Teradata Vantage

Teradata® Vantage Machine Learning Engine Analytic Function Reference

Product
Teradata Vantage
Release Number
1.0
8.00
Release Date
May 2019
Content Type
Programming Reference
Publication ID
B700-4003-098K
Language
English (United States)

Input

In the following figure, nodes represent persons—light blue for males and dark blue for females. The directed edges represent phone calls from one person to another. Node size represents number of connections (degree centrality).

Graph of Phone Calls between Persons

The graph in the figure is represented by the vertices and edges tables callers and calls, respectively.

vertices: callers
callerid callername
1 John
2 Carla
3 Simon
4 Celine
5 Winston
6 Diana
edges: calls
callerfrom callerto calls
2 4 7
2 6 12
4 6 4
1 2 10
1 3 2
1 4 5
1 6 6
3 6 1
5 6 10

SQL Call

SELECT * FROM AllPairsShortestPath (
  ON callers AS vertices PARTITION BY callerid
  ON calls AS edges PARTITION BY callerfrom
  USING
  TargetKey ('callerto')
  MaxDistance (-1)
) AS dt ORDER BY source, target;

Output

source target distance
1 2 1
1 3 1
1 4 1
1 6 1
2 4 1
2 6 1
3 6 1
4 6 1
5 6 1