GSQL Graph Algorithm Library
Updated May 7, 2019
Graph algorithms are functions for measuring characteristics of graphs, vertices, or relationships. Graph algorithms can provide insights into the role or relevance of individual entities in a graph. For example: How centrally located is this vertex? How much influence does this vertex exert over the others?
Some graph algorithms measure or identify global characteristics: What are the natural community groupings in the graph? What is the density of connections?

# Using the GSQL Graph Algorithm Library

The GSQL Graph Algorithm Library is a collection of expertly written GSQL queries, each of which implements a standard graph algorithm. Each algorithm is ready to be installed and used, either as a stand-alone query or as a building block of a larger analytics application.
GSQL running on the TigerGraph platform is particularly well-suited for graph algorithms for the several reasons:
• Turing-complete with full support for imperative and procedural programming, ideal for algorithmic computation.
• Parallel and Distributed Processing, enabling computations on larger graphs.
• User-Extensible. Because the algorithms are written in standard GSQL and compiled by the user, they are easy to modify and customize.
• Open-Source. Users can study the GSQL implementations to learn by example, and they can develop and submit additions to the library.

## Library Structure

The library contains two main sections: algorithms and tests. The algorithms folder contains template algorithms and scripts to help you customize and install them. The tests folder contains small sample graphs that you can use to experiment with the algorithms. In this document, we use the test graphs to show you the expected result for each algorithm. The graphs are small enough that you can manually calculate and sometimes intuitively see what the answers should be.

## Installing an Algorithm

Remember that GSQL graph algorithms are simply GSQL queries. However, since we do not know what vertices or edges you want to analyze, or how you want to receive output, the algorithms are in a template format. You need to run a script to personalize your algorithm and then to install it.
Make sure that the install.sh is owned by the tigergraph user.
1. 1.
Within the Algorithms folder is a script install.sh. When you run the script, it will first ask you which graph schema you wish to work on. (The TigerGraph platform supports multiple concurrent graphs.)
2. 2.
It then asks you to choose from a menu of available algorithms.
3. 3.
After knowing your graph schema and your algorithm, the installer will ask you some questions for that particular algorithm:
1. 1.
the installer will guide you in selecting appropriate vertex types and edges types. Note this does not have to be all the vertex or edge types in your graph. For example, you may have a social graph with three categories of persons and five types of relationships. You might decide to compute PageRank using Member and Guest vertices and Recommended edges.
2. 2.
Some algorithms use edge weights as input information (such as Shortest Path where each edge has a weight meaning the "length" of that edge. The installer will ask for the name of that edge attribute.
4. 4.
Single Node Mode or Distributed Mode? Queries which will analyze the entire graph (such PageRank and Community Detection) will run better in Distributed Mode, if you have a cluster of machines.
5. 5.
It will then ask you what type of output you would like. It will proceed to create up to three versions of your algorithm, based on the three ways of receiving the algorithm's output:
1. 1.
Stream the output in JSON format, the default behavior for most GSQL queries.
2. 2.
Save the output value(s) in CSV format to a file. For some algorithms, this option will add an input parameter to the query, to let the user specify how many total values to output.
3. 3.
Store the results as vertex or edge attribute values. The attributes must already exist in the graph schema, and the installer will ask you which attributes to use.
6. 6.
After creating queries for one algorithm, the installer will loop back to let you choose another algorithm (returning to step 2 above).
7. 7.
If you choose to exit, the installer makes a last request: Do you want to install your queries? Installation is when the code is compiled and bound into the query engine. It takes a few minutes, so it is best to create all your personalized queries at once and then install them as a group.
Example:
1
$bash install.sh 2 *** GSQL Graph Algorithm Installer *** 3 Available graphs: 4 - Graph social(Person:v, Friend:e, Also_Friend:e, Coworker:e) 5 Graph name? social 6 7 Please enter the number of the algorithm to install: 8 1) EXIT 9 2) Closeness Centrality 10 3) Connected Components 11 4) Label Propagation 12 5) Community detection: Louvain 13 6) PageRank 14 7) Shortest Path, Single-Source, Any Weight 15 8) Triangle Counting(minimal memory) 16 9) Triangle Counting(fast, more memory) 17 #? 6 18 pageRank() works on directed edges 19 20 Available vertex and edge types: 21 - VERTEX Person(PRIMARY_ID id STRING, name STRING, score FLOAT, tag STRING) WITH STATS="OUTDEGREE_BY_EDGETYPE" 22 - DIRECTED EDGE Friend(FROM Person, TO Person, weight FLOAT, tag STRING) WITH REVERSE_EDGE="Also_Friend" 23 - DIRECTED EDGE Also_Friend(FROM Person, TO Person, weight FLOAT, tag STRING) WITH REVERSE_EDGE="Friend" 24 - UNDIRECTED EDGE Coworker(FROM Person, TO Person, weight FLOAT, tag STRING) 25 26 Please enter the vertex type(s) and edge type(s) for running PageRank. 27 Use commas to separate multiple types [ex: type1, type2] 28 Leaving this blank will select all available types 29 Similarity algorithms only take single vertex type 30 31 Vertex types: Person 32 Edge types: Friend 33 The query pageRank is dropped. 34 The query pageRank_file is dropped. 35 The query pageRank_attr is dropped. 36 37 Please choose query mode: 38 1) Single Node Mode 39 2) Distributed Mode 40 #? 1 41 42 Please choose a way to show result: 43 1) Show JSON result 3) Save to Attribute/Insert Edge 44 2) Write to File 4) All of the above 45 #? 4 46 47 gsql -g social ./templates/pageRank.gsql 48 The query pageRank has been added! 49 50 gsql -g social ./templates/pageRank_file.gsql 51 The query pageRank_file has been added! 52 53 If your graph schema has appropriate vertex or edge attributes, 54 you can update the graph with your results. 55 Do you want to update the graph [yn]? y 56 Vertex attribute to store FLOAT result (e.g. pageRank): score 57 gsql -g social ./templates/pageRank_attr.gsql 58 The query pageRank_attr has been added! 59 Created the following algorithms: 60 - pageRank(float maxChange, int maxIter, float damping, bool display, int outputLimit) 61 - pageRank_attr(float maxChange, int maxIter, float damping, bool display) 62 - pageRank_file(float maxChange, int maxIter, float damping, bool display, file f) 63 64 65 Please enter the number of the algorithm to install: 66 1) EXIT 67 2) Closeness Centrality 68 3) Connected Components 69 4) Label Propagation 70 5) Community detection: Louvain 71 6) PageRank 72 7) Shortest Path, Single-Source, Any Weight 73 8) Triangle Counting(minimal memory) 74 9) Triangle Counting(fast, more memory) 75 #? 1 76 Exiting 77 Algorithm files have been created. Do want to install them now [yn]? y 78 Start installing queries, about 1 minute ... 79 c 80 pageRank query: curl -X GET 'http://127.0.0.1:9000/query/social/pageRank?maxChange=VALUE&maxIter=VALUE&damping=VALUE&display=VALUE&outputLimit=VALUE'. Add -H "Authorization: Bearer TOKEN" if authentication is enabled. 81 pageRank_file query: curl -X GET 'http://127.0.0.1:9000/query/social/pageRank_file?maxChange=VALUE&maxIter=VALUE&damping=VALUE&display=VALUE&f=VALUE'. Add -H "Authorization: Bearer TOKEN" if authentication is enabled. 82 pageRank_attr query: curl -X GET 'http://127.0.0.1:9000/query/social/pageRank_attr?maxChange=VALUE&maxIter=VALUE&damping=VALUE&display=VALUE'. Add -H "Authorization: Bearer TOKEN" if authentication is enabled. 83 84 [======================================================================================================] 100% (3/3) 85$
Copied!
After the algorithms are installed, you will see them listed among the rest of your GSQL queries.
1
GSQL > ls
2
...
3
Queries:
4
- cc_subquery(vertex v, int numVert, int maxHops) (installed v2)
5
- closeness_cent(bool display, int outputLimit) (installed v2)
6
- closeness_cent_attr(bool display) (installed v2)
7
- closeness_cent_file(bool display, file f) (installed v2)
8
- conn_comp() (installed v2)
9
- conn_comp_attr() (installed v2)
10
- conn_comp_file(file f) (installed v2)
11
- label_prop(int maxIter) (installed v2)
12
- label_prop_attr(int maxIter) (installed v2)
13
- label_prop_file(int maxIter, file f) (installed v2)
14
- louvain() (installed v2)
15
- louvain_attr() (installed v2)
16
- louvain_file(file f) (installed v2)
17
- pageRank(float maxChange, int maxIter, float damping, bool display, int outputLimit) (installed v2)
18
- pageRank_attr(float maxChange, int maxIter, float damping, bool display) (installed v2)
19
- pageRank_file(float maxChange, int maxIter, float damping, bool display, file f) (installed v2)
20
- tri_count() (installed v2)
21
- tri_count_fast() (installed v2)
22
Copied!
We will soon update the library so that most of schema choices can be made when running the algorithm, rather than when installing the algorithm.

## Running an Algorithm

Running an algorithm is the same as running a GSQL query. For example, if you selected the JSON option for pageRank, you could run it from GSQL as below:
1
GSQL > RUN QUERY pageRank(0.001, 25, 0.85, 10)
Copied!
Installing a query also creates a REST endpoint. The same query could be run thus:
1
curl -X GET 'http://127.0.0.1:9000/query/alg_graph/pageRank?maxChange=0.001&maxIter=25&damping=0.85&outputSize=10'
Copied!
GSQL lets you run queries from within other queries. This means you can use a library algorithm as a building block for more complex analytics.

# Library Overview

The following algorithms are currently available. The algorithms are grouped into three classes:
• Path
• Centrality
• Community
• Similarity (NEW)
Moreover, each algorithm may or may be be currently available for a graph with Undirected Edges, Directed Edges, and Weighted Edges.
• Coming soon means that TigerGraph plans to release this variant of the algorithm soon.
• n/a means that this variant of the algorithm is typically not used
Algorithm
Class
Undirected
Edges
Directed
Edges
Weighted
Edges
Single-Source Shortest Path
Path
Yes
Yes
Yes
All Pairs Shortest Path
Path
Yes
Yes
Yes
Minimum Spanning Tree
Path
Yes
n/a
Yes
Cycle Detection
Path
no
Yes
n/a
PageRank
Centrality
n/a
Yes
Coming soon
Personalized PageRank
Centrality
n/a
Yes
Coming soon
Closeness Centrality
Centrality
Yes
n/a
Coming soon
Betweenness Centrality
Centrality
Coming soon
n/a
Coming soon
Weakly Connected Components
Community
Yes
n/a
n/a
Strongly Connected Components
Community
n/a
Coming soon
n/a
Label Propagation
Community
Yes
n/a
n/a
Louvain Modularity
Community
Yes
n/a
n/a
Triangle Counting
Community
Yes
n/a
n/a
Cosine Similarity of Neighborhoods (single-source and all-pairs)
Similarity
Yes
Yes
Yes
Jaccard Similarity of Neighborhoods (single-source and all-pairs)
Similarity
Yes
Yes
No

## Computational Complexity

Computational Complexity is a formal mathematical term, referring to how an algorithm's time requirements scale according to the size of the data or other key parameters. For graphs, there are two key data parameters:
• V (or sometimes n), the number of vertices
• E (or sometimes m), the number of edges
The notation O(V^2) (read "big O V squared") means that when V is large, the computational time is proportional to V^2.

# Path Algorithms

These algorithms help find the shortest path or evaluate the availability and quality of routes.

## Single-Source Shortest Path, Unweighted

The algorithm we are discussing here finds an unweighted shortest path from one source vertex to each possible destination vertex in the graph. That is, it finds n paths.
If you just want to know the shortest path between two particular vertices, S and T in a graph with unweighted edges, we have described that query in detail in our tutorial document GSQL Demo Examples.
If your graph has weighted edges, see the next algorithm.

### Description and Uses

If a graph has unweighted edges, then finding the shortest path from one vertex to another is the same as finding the path with the fewest hops. Think of Six Degrees of Separation and Friend of a Friend. Unweighted Shortest Path answers the question "How are you two related?" The two entities do not have to be persons. Shortest Path is useful in a host of applications, from estimating influences or knowledge transfer, to criminal investigation.
When the graph is unweighted, we can use a "greedy" approach to find the shortest path. In computer science, a greedy algorithm makes intermediate choices based on the data being considered at the moment, and then does not revisit those choices later on. In this case, once the algorithm finds any path to a vertex T, it is certain that that is a shortest path.

### Specifications

1
shortest_ss_no_wt(VERTEX v, BOOL display)
2
shortest_ss_no_wt_file(VERTEX v, BOOL display, STRING filepath)
3
shortest_ss_no_wt_attr(VERTEX v, BOOL display)
Copied!
Characteristic
Value
Result
Computes a shortest distance (INT) and shortest path (STRING) from vertex v to each other vertex T. The result is available in 3 forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as two vertex attribute values.
Input Parameters
• v: id of the source vertex
• display: If true, include the graph's edges in the JSON output, so that the full graph can be displayed.
• filepath (for file output only): the path to the output file
Result Size
V = number of vertices
Computational Complexity
O(E), E = number of edges
Graph Types
Directed or Undirected edges, Unweighted edges

### Example

In the below graph, we do not consider the weight on edge. Using vertex A as the source vertex, the algorithm discovers that the shortest path from A to B is A-B, and the shortest path from A to C is A-D-C, etc.
generic graph with shortest_pos5 choice, not considering weight
1
[
2
{
3
"ResultSet": [
4
{
5
"v_id": "B",
6
"v_type": "Node",
7
"attributes": {
10
"A",
11
"B"
12
]
13
}
14
},
15
{
16
"v_id": "A",
17
"v_type": "Node",
18
"attributes": {
21
"A"
22
]
23
}
24
},
25
{
26
"v_id": "C",
27
"v_type": "Node",
28
"attributes": {
31
"A",
32
"D",
33
"C"
34
]
35
}
36
},
37
{
38
"v_id": "E",
39
"v_type": "Node",
40
"attributes": {
43
"A",
44
"D",
45
"E"
46
]
47
}
48
},
49
{
50
"v_id": "D",
51
"v_type": "Node",
52
"attributes": {
55
"A",
56
"D"
57
]
58
}
59
}
60
]
61
}
62
]
Copied!

## Single-Source Shortest Path, Weighted

### Description and Uses

Finding shortest paths in a graph with weighted edges is algorithmically harder than in an unweighted graph because just because you find a path to a vertex T, you cannot be certain that it is a shortest path. If edge weights are always positive, then you must keep trying until you have considered every in-edge to T. If edge weights can be negative, then it's even harder. You must consider all possible paths.
A classic application for weighted shortest path is finding the shortest travel route to get from A to B. (Think of route planning "GPS" apps.) In general, any application where you are looking for the cheapest route is a possible fit.

### Specifications

The shortest path algorithm can be optimized if we know all the weights are nonnegative. If there can be negative weights, then sometimes a longer path will have a lower cumulative weight. Therefore, we have two versions of this algorithm
1
shortest_path_pos_wt(VERTEX v, BOOL display)
2
shortest_path_pos_wt_file(VERTEX v, BOOL display, STRING filepath)
3
shortest_path_pos_wt_attr(VERTEX v, BOOL display)
Copied!
1
shortest_path_neg_wt(VERTEX v, BOOL display)
2
shortest_path_neg_wt_file(VERTEX v, BOOL display, STRING filepath)
3
shortest_path_neg_wt_attr(VERTEX v, BOOL display)
Copied!
Characteristic
Value
Result
Computes a shortest distance (INT) and shortest path (STRING) from vertex v to each other vertex T. The result is available in 3 forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as two vertex attribute values.
Input Parameters
• v: id of the source vertex
• display: If true, include the graph's edges in the JSON output, so that the full graph can be displayed.
• filepath (for file output only): the path to the output file
Result Size
V = number of vertices
Computational Complexity
O(V*E), V = number of vertices, E = number of edges
Graph Types
Directed or Undirected edges, Weighted edges
The shortest_path_neg_wt library query is an implementation of the Bellman-Ford algorithm. If there is more than one path with the same total weight, the algorithm returns one of them.

### Example

The graph below has only positive edge weights. Using vertex A as the source vertex, the algorithm discovers that the shortest weighted path from A to B is A-D-B, with distance 8. The shortest weighted path from A to C is A-D-B-C with distance 9.
generic graph with shortest_pos5 choice
1
[
2
{
3
"ResultSet": [
4
{
5
"v_id": "B",
6
"v_type": "Node",
7
"attributes": {
10
"D",
11
"B"
12
]
13
}
14
},
15
{
16
"v_id": "A",
17
"v_type": "Node",
18
"attributes": {
21
}
22
},
23
{
24
"v_id": "C",
25
"v_type": "Node",
26
"attributes": {
29
"D",
30
"B",
31
"C"
32
]
33
}
34
},
35
{
36
"v_id": "E",
37
"v_type": "Node",
38
"attributes": {
41
"D",
42
"E"
43
]
44
}
45
},
46
{
47
"v_id": "D",
48
"v_type": "Node",
49
"attributes": {
52
"D"
53
]
54
}
55
}
56
]
57
}
58
]
Copied!
The graph below has both positive and negative edge weights. Using vertex A as the source vertex, the algorithm discovers that the shortest weighted path from A to E is A-D-C-B-E, with a cumulative score of 7 - 3 - 2 - 4 = -2.
shortest_path_wt(A, -1, true, "json") on shortest_neg5 graph

## Single-Pair Shortest Path

The Single-Pair Shortest Path task seeks the shortest path between a source vertex S and a target vertex T. If the edges are unweighted, then use the query in our tutorial document GSQL Demo Examples.
If the edges are weighted, then use the Single-Source Shortest Path algorithm. In the worst case, it takes the same computational effort to find the shortest path for one pair as to find the shortest paths for all pairs from the same source S. The reason is that you cannot know whether you have found the shortest (least weight) path until you have explored the full graph. If the weights are always positive, however, then a more efficient algorithm is possible. You can stop searching when you have found paths that use each of the in-edges to T.

## All-Pairs Shortest Path

The All-Pairs Shortest Path algorithm is costly for large graphs, because the computation time is O(V^3) and the output size is O(V^2). Be cautious about running this on very large graphs.
The All-Pairs Shortest Path (APSP) task seeks to find shortest paths between every pair of vertices in the entire graph. In principle, this task can be handled by running the Single-Source Shortest Path (SSSP) algorithm for each input vertex, e.g.,
1
CREATE QUERY all_pairs_shortest(INT maxDepth, BOOL display, STRING fileBase)
2
{
3
Start = {Node.*};
4
Result = SELECT s FROM Start:s
5
POST-ACCUM
6
shortest_ss_any_wt_file(s, maxDepth, display, fileBase+s);
7
}
Copied!
This example highlights one of the strengths of GSQL: treating queries as stored procedures which can be called from within other queries.
For large graphs (with millions of vertices or more), however, this is an enormous task. While the massively parallel processing of the TigerGraph platform can speed up the computation by 10x or 100x, consider what it takes just to store or report the results. If there are 1 million vertices, then there are nearly 1 trillion output values.
There are more efficient methods than calling the single-source shortest path algorithm n times, such as the Floyd-Warshall algorithm, which computes APSP in O(V^3) time.
Our recommendation:
• If you have a smaller graph (perhaps thousands or tens of thousands of vertices), the APSP task may be tractable.
• If you have a large graph, avoid using APSP.

## Minimum Spanning Tree (MST)

### Description and Uses

Given an undirected and connected graph, a minimum spanning tree is a set of edges which can connect all the vertices in the graph with the minimal sum of edge weight. A parallel version of the PRIM algorithm is implemented in the library:
1. 1.
Start with a set A = { an arbitrary vertex r }
2. 2.
For all vertices in A, find another vertex y in the graph not A and y is connected to a vertex x in A such that the weight on the edge e(x,y) is the smallest among all such edges from a vertex in A to a vertex not in A. Add y to A, and add the edge (x,y) to MST
3. 3.
Repeat 2 until A has all vertices in the graph.

### Specifications

1
mst (VERTEX source)
2
mst_file (VERTEX source, FILE f)
3
mst_attr (VERTEX source)
Copied!
Characteristic
Value
Result
Computes a MST. The result is available in 3 forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as an edge attribute value.
Input Parameters
• source: id of the source vertex
• filepath (for file output only): the path to the output file
Result Size
V - 1 = number of vertices - 1
Computational Complexity
Graph Types
Undirected edges and connected
Example
In social10 graph, we consider only the undirected Coworker edges.
social10 graph with Coworker edges
This graph has 3 components. Minimum Spanning Tree finds a tree for one component, so which component it will work on depends on what vertex we give as the starting point. If we select Fiona, George, Howard, or Ivy as the start vertex, then it work on the 4-vertex component on the left. You can start from any vertex in the component and get the same or an equivalent MST result.
The figure below shows the result of mst(("Ivy", "Person")). Note that the value for the one vertex is ("Ivy","Person"). In GSQL, this 2-tuple format which explicitly gives the vertex type is used when the query is written to accept a vertex of any type.
mst(("Ivy","Person")) on social10 graph, with Coworker edges
File output:
1
From,To,Weight
2
Ivy,Fiona,6
3
Ivy,Howard,4
4
Ivy,George,4
Copied!
The attribute version requires a boolean attribute on the edge, and it will assign the attribute to "true" if that edge is selected in the MST:
mst_attr(("Ivy","Person")) on social10 graph, with Coworker edges & edge attribute "flag"

## Cycle Detection

### Description and Uses

The Cycle Detection problem seeks to find all the cycles (loops) in a graph. We apply the usual restriction that the cycles must be "simple cycles", that is, they are paths that start and end at the same vertex but otherwise never visit any vertex twice.
There are two versions of the task: for directed graphs and undirected graphs. The GSQL algorithm library currently supports only directed cycle detection. The Rocha–Thatte algorithm is an efficient distributed algorithm, which detects all the cycles in a directed graph. The algorithm will self-terminate, but it is also possible to stop at k iterations, which finds all the cycles having lengths up to k edges.
The basic idea of the algorithm is to (potentially) traverse every edge in parallel, again and again, forming all possible paths. At each step, if a path forms a cycle, it records it and stops extending it. More specifically: Initialization: For each vertex, record one path consisting of its own id. Mark the vertex as Active.
Iteration steps: Fo each Active vertex v:
1. 1.
Send its list of paths to each of its out-neighbors.
2. 2.
Inspect each path P in the list of the paths received:
• If the first id in P is also id(v), a cycle has been found:
• Remove P from its list.
• If id(v) is the least id of any id in P , then add P to the Cycle List. (The purpose is to count each cycle only once.)
• Else, if id(v) is somewhere else in the path, then remove P from the path list (because this cycle must have been counted already).
• Else, append id(v) to the end of each of the remaining paths in its list.

### Specifications

1
cycle_detection (INT depth)
2
cycle_detection_file (INT depth, FILE f)
Copied!
The algorithm traverses all edges. A user could modify the GSQL algorithm so that it traverse only edges of a certain type.
Characteristic
Value
Result
Computes a list of vertex id lists, each of which is a cycle. The result is available in 2 forms:
• streamed out in JSON format
• written to a file in tabular format
Input Parameters
• depth: the maximum cycle length to search for = maximum number of iterations
• filepath (for file output only): the path to the output file
Result Size
Number of cycles * average cycle length
Both of these measures are not known in advance.
Computational Complexity
O(E *k), E = number of edges.
k = min(max. cycle length, depth paramteter)
Graph Types
Directed
Example
In the social10 graph, there are 5 cycles, all with the Fiona-George-Howard-Ivy cluster.
cycle_detection(10) on social10 graph
1
[
2
{
3
"@@cycles": [
4
[
5
"Fiona",
6
"Ivy"
7
],
8
[
9
"George",
10
"Ivy"
11
],
12
[
13
"Fiona",
14
"George",
15
"Ivy"
16
],
17
[
18
"George",
19
"Howard",
20
"Ivy"
21
],
22
[
23
"Fiona",
24
"George",
25
"Howard",
26
"Ivy"
27
]
28
]
29
}
30
]
Copied!

# Centrality Algorithms

Centrality algorithms determine the importance of each vertex within a network. Typical applications:
PageRank is designed for directed edges. The classic interpretation is to find the most "important" web pages, based on hyperlink referrals, but it can be used for another network where entities make positive referrals of one another.
Closeness Centrality and Betweenness Centrality both deal with the idea of "centrally located."

## PageRank

### Description and Uses

The PageRank algorithm measures the influence of each vertex on every other vertex. PageRank influence is defined recursively: a vertex's influence is based on the influence of the vertices which refer to it. A vertex's influence tends to increase if (1) it has more referring vertices or if (2) its referring vertices have higher influence. The analogy to social influence is clear.
A common way of interpreting PageRank value is through the Random Network Surfer model. A vertex's pageRank score is proportional to the probability that a random network surfer will be at that vertex at any given time. A vertex with a high pageRank score is a vertex that is frequently visited, assuming that vertices are visited according to the following Random Surfer scheme:
• Assume a person travels or surfs across a network's structure, moving from vertex to vertex in a long series of rounds.
• The surfer can start anywhere. This start-anywhere property is part of the magic of PageRank, meaning the score is a truly fundamental property of the graph structure itself.
• Each round, the surfer randomly picks one of the outward connections from the surfer's current location. The surfer repeats this random walk for a long time.
• But wait. The surfer doesn't always follow the network's connection structure. There is a probability (1-damping, to be precise), that the surfer will ignore the structure and will magically teleport to a random vertex.

### Specifications

1
pageRank(FLOAT maxChange, INT maxIter, FLOAT damping, BOOL display, INT outputLimit)
2
pageRank_file(FLOAT maxChange, INT maxIter, FLOAT damping, FILE f)
3
pageRank_attr(FLOAT maxChange, INT maxIter, FLOAT damping)
Copied!
Characteristic
Value
Result
Computes a PageRank value (FLOAT type) for each vertex. The result is available in 3 forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as a vertex attribute value.
Input Parameters
• maxChange: PageRank will stop iterating when the largest difference between any vertex's current score and its previous score ≤ maxChange. That is, the scores have become very stable and are changing by less that maxChange from one iteration to the next. Suggested value: 0.001 or less.
• maxIter: maximum number of iterations. Suggested value: between 10 and 100.
• damping: fraction of score that is due to the score of neighbors. The balance (1 - damping) is a minimum baseline score that every vertex receives. Suggested value: 0.85.
• f (for file output only): the path to the output file
• display (for JSON output only): If true, include the graph's edges in the JSON output, so that the full graph can be displayed.
• outputLimit (for JSON output only): maximum number of vertex values to output. Values will be sorted with highest value first.
Result Size
V = number of vertices
Computational Complexity
O(E*k), E = number of edges, k = number of iterations.
The number of iterations is data-dependent, but the user can set a maximum. Parallel processing reduces the time needed for computation.
Graph Types
Directed edges

### Example

We ran pageRank on our test10 graph (using Friend edges) with the following parameter values: damping=0.85, maxChange=0.001, and maxIter=25. We see that Ivy (center bottom) has the highest pageRank score (1.12). This makes sense, since there are 3 neighboring persons who point to Ivy, more than for any other person. Eddie and Justin have scores have exactly 1, because they do not have any out-edges. This is an artifact of our particular version pageRank. Likewise, Alex has a score of 0.15, which is (1-damping), because Alex has no in-edges.
pageRank_attr(0.001, 25, 0.85,"json",10) on social10 graph, with Friend edges

## Personalized PageRank

### Description and Uses

In the original PageRank, the damping factor is the probability of the surfer continues browsing at each step. The surfer may also stop browsing and start again from a random vertex. In personalized PageRank, the surfer can only start browsing from a given set of source vertices both at the beginning and after stopping.

### Specifications

1
pageRank_pers(Set<Vertex> source, FLOAT maxChange, INT maxIter, FLOAT damping, INT outputLimit)
2
pageRank_pers_file(Set<Vertex> source, FLOAT maxChange, INT maxIter, FLOAT damping, FILE f)
3
pageRank_pers_attr(Set<Vertex> source, FLOAT maxChange, INT maxIter, FLOAT damping)
Copied!
Characteristic
Value
Result
Computes a personalized PageRank value (FLOAT type) for each vertex. The result is available in 3 forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as a vertex attribute value.
Input Parameters
• source: a set of source vertices
• maxChange: personalized PageRank will stop iterating when the largest difference between any vertex's current score and its previous score ≤ maxChange. That is, the scores have become very stable and are changing by less that maxChange from one iteration to the next. Suggested value: 0.001 or less.
• maxIter: maximum number of iterations. Suggested value: between 10 and 100.
• damping: fraction of score that is due to the score of neighbors. The balance (1 - damping) is a minimum baseline score that every vertex receives. Suggested value: 0.85.
• f (for file output only): the path to the output file
• outputLimit (for JSON output only): maximum number of vertex values to output. Values will be sorted with highest value first.
Result Size
V = number of vertices
Computational Complexity
O(E*k), E = number of edges, k = number of iterations.
The number of iterations is data-dependent, but the user can set a maximum. Parallel processing reduces the time needed for computation.
Graph Types
Directed edges

### Example

We ran Personalized PageRank on our test10 graph using Friend edges with the following parameter values: damping=0.85, maxChange=0.001, maxIter=25, and source="Fiona". In this case, the random walker can only start or restart walking from Fiona. In the figure below, we see that Fiona has the highest pageRank score in the result. Ivy and George have the next highest scores, because they are direct out-neighbors of Ivy and there are looping paths that lead back to them again. Half of the vertices have a score of 0, since they can not be reached from Fiona.
pageRank_pers_attr([("Fiona","Person")],0.001,25,0.85) on social10 graph, with Friend edges

## Closeness Centrality

We all have an intuitive understanding when we say a home, an office, or a store is "centrally located." Closeness Centrality provides a precise measure of how "centrally located" is a vertex. The steps below show the steps for one vertex v.
Description of Steps
Mathematical Formulation
1. Compute the average distance from vertex v to every other vertex:
$d_{avg}(v) = \sum_{u \ne v} dist(v,u)/(n-1)$
2. Invert the average distance, so we have average closeness of v:
$CC(v) = 1/d_{avg}(v)$
These steps are repeated for every vertex in the graph.

### Specifications

1
closeness_cent(BOOL display, INT maxOutput)
2
closeness_cent_file(BOOL display, STRING filepath)
3
closeness_cent_attr(BOOL display)
Copied!
Parameters
Characteristic
Value
Result
Computes a Closeness Centrality value (FLOAT type) for each vertex. The result is available in 3 forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as a vertex attribute value.
Required Input Parameters
• display: If true, include the graph's edges in the JSON output, so that the full graph can be displayed.
filepath (for file output only): the path to the output file
• maxOutput (for JSON output only): maximum number of vertex values to output. Values will be sorted with highest value first.
Result Size
V = number of vertices
Computational Complexity
O(E*k), E = number of edges, k = number of iterations.
The number of iterations is data-dependent, but the user can set a maximum. Parallel processing reduces the time needed for computation.
Graph Types
Directed or Undirected edges, Unweighted edges

### Example

Closeness centrality can be measured for either directed edges (from v to others) or for undirected edges. Directed graphs may seem less intuitive, however. because if the distance from Alex to Bob is 1, it does not mean the distance from Bob to Alex is also 1.
For our example, we wanted to use the topology of the Likes graph, but to have undirected edges. We emulated an undirected graph by using both Friend and Also_Friend (reverse direction) edges.
closeness_cent("json",10) on social10 graph, with Friend and Also_Friend edges

# Community Algorithms

These algorithms evaluate how a group is clustered or partitioned, as well as its tendency to strengthen or break apart.

## Connected Components

### Description and Uses

A component is the maximal set of vertices, plus their connecting edges, which are interconnected. That is, you can reach each vertex from each other vertex. In the example figure below, there are three components.
This particular algorithm deals with undirected edges. If the same definition (each vertex can reach each other vertex) is applied to directed edges, then the components are called Strongly Connected Components. If you have directed edges but ignore the direction (permitting traversal in either direction), then the algorithm finds Weakly Connected Components.

### Specifications

1
conn_comp()
2
conn_comp_file(STRING filepath)
3
conn_comp_attr()
Copied!
Characteristic
Value
Result
Assigns a component id (INT) to each vertex, such that members of the same component have the same id value. The result is available in three forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as a vertex attribute value.
Input Parameters
• filepath (for file output only): the path to the output file
Result Size
V = number of vertices
Computational Complexity
O(E*d), E = number of edges, d = max(diameter of components)
Graph Types
Undirected edges

### Example

It is easy to see in this small graph that the algorithm correctly groups the vertices:
• Alex, Bob and Justin all have Community ID = 2097152
• Chase, Damon, and Eddie all have Community ID = 5242880
• Fiona, George, Howard, and Ivy all have Community ID = 0
Our algorithm uses the TigerGraph engine's internal vertex ID numbers; they cannot be predicted.
conn_comp(true, "json") on social10 graph with Coworker edges

## Label Propagation

### Description and Uses

Label Propagation is a heuristic method for determining communities. The idea is simple: If the plurality of your neighbors all bear the label X, then you should label yourself as also a member of X. The algorithm begins with each vertex having its own unique label. Then we iteratively update labels based on the neighbor influence described above. It is important that they the order for updating the vertices be random. The algorithm is favored for its efficiency and simplicity, but it is not guaranteed to produce the same results every time.
In a variant version, some vertices could initially be known to belong to the same community,. If they are well-connected to one another, they are likely to preserve their common membership and influence their neighbors,

### Specifications

1
label_prop(INT maxIter)
2
label_prop_file(INT maxIter, FILE filepath)
3
label_prop_attr(INT maxIter)
Copied!
Characteristic
Value
Result
Assigns a component id (INT) to each vertex, such that members of the same component have the same id value. The result is available in three forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as a vertex attribute value.
Input Parameters
• maxIter: the maximum number of update iterations.
• filepath (for file output only): the path to the output file
Result Size
V = number of vertices
Computational Complexity
O(E*k), E = number of edges, k = number of iterations.
Graph Types
Undirected edges

### Example

This is the same graph that was used in the Connected Component example. The results are different, though. The quartet of Fiona, George, Howard, and Ivy have been split into 2 groups. See can see the symmetry:
• (George & Ivy) each connect to (Fiona & Howard) and to one another.
• (Fiona & Howard) each connect to (George & Ivy) but not to one another.
Label Propagation tries to find natural clusters and separations within connected components. That is, it looks at the quality and pattern of connections. The Component Component algorithm simply asks the Yes or No question: Are these two vertices connected?
We set maxIter to 10, but the algorithm reached steady state after 3 iterations.
label_prop(10) on social10 graph with Coworker edges

## Louvain Modularity for Community Detection (Deprecated)

### ​

This algorithm is deprecated because a much higher performance algorithm (louvain_parallel) should be used instead of the original louvain algorithm.

### Description and Uses

The modularity score for a partitioned graph assesses the difference in density of links within a partition vs. the density of links crossing from one partition to another. The assumption is that if a partitioning is good (that is, dividing up the graph into communities or clusters), then the within-density should be high and the inter-density should be low.
Also, we use changes in modularity to guide optimization of the partitioning. That is, we begin with a candidate partitioning and measure its modularity. Then we make an incremental change and confirm that the modularity has improved.
The most most efficient and empirically effective method for calculating modularity was published by a team of researchers at the University of Louvain. The Louvain method uses agglomeration and hierarchical optimization:
1. 1.
Optimize modularity for small local communities.
2. 2.
Treat each optimized local group as one unit, and repeat the modularity operation for groups of these condensed units.

### Specifications

1
louvain()
2
louvain_file(FILE filepath)
3
louvain_attr()
Copied!

## Louvain Method with Parallelism and Refinement

### Description and Uses

The Louvain Method for community detection [1] partitions the vertices in a graph by approximately maximizing the graph's modularity score. The modularity score for a partitioned graph assesses the difference in density of links within a partition vs. the density of links crossing from one partition to another. The assumption is that if a partitioning is good (that is, dividing up the graph into communities or clusters), then the within-density should be high and the inter-density should be low.
The most efficient and empirically effective method for calculating modularity was published by a team of researchers at the University of Louvain. The Louvain method uses agglomeration and hierarchical optimization:
1. 1.
Optimize modularity for small local communities.
2. 2.
Treat each optimized local group as one unit, and repeat the modularity operation for groups of these condensed units.
The original Louvain Method contains two phases. The first phase incrementally calculates the modularity change of moving a vertex into every other community, and moves the vertex to the community with highest modularity change. The second phase coarsens the graph by aggregating the vertices which are assigned in the same community into one vertex. The first phase and second phase make up a pass. The Louvain Method performs the passes iteratively. In other words, the algorithm assigns an initial community label to every vertex, then performs the first phase, during which the community labels are changed, until there is no modularity gain. Then it aggregates the vertices with same labels into one vertex, and calculates the aggregated edge weights between new vertices. For the coarsened graph, the algorithm conducts first phase again to move the vertices into new communities. The algorithm continues until the modularity is not increasing, or runs to the preset iteration limits.
However, phase one is sequential, and thus slow for large graphs. An improved Parallel Louvain Method Louvain Method (PLM) calculates the best community to move to for each vertex in parallel [2]. In Parallel Louvain Method(PLM), the positive modularity gain is not guaranteed, and it may also swap two vertices to each other’s community. After finishing the passes, there is an additional refinement phase, which is running the first phase again on each vertex to do some small adjustments for the resulting communities. [3].
[1] Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of statistical mechanics: theory and experiment 2008.10 (2008): P10008.
[2] Staudt, Christian L., and Henning Meyerhenke. "Engineering parallel algorithms for community detection in massive networks." IEEE Transactions on Parallel and Distributed Systems 27.1 (2016): 171-184.
[3] Lu, Hao, Mahantesh Halappanavar, and Ananth Kalyanaraman. "Parallel heuristics for scalable community detection." Parallel Computing 47 (2015): 19-37.

### Specifications

1
louvain_parallel(INT iter1 = 10, INT iter2 = 10, INT iter3 = 10, INT split = 10, INT outputLevel = 0)
2
louvain_parallel_file(INT iter1 = 10, INT iter2 = 10, INT iter3 = 10, INT split = 10, INT outputLevel = 0, FILE fComm, FILE fDist)
3
louvain_parallel_attr(INT iter1 = 10, INT iter2 = 10, INT iter3 = 10, INT split = 10, INT outputLevel = 0)
Copied!
Characteristic
Value
Result
Assigns a component id (INT) to each vertex, such that members of the same component have the same id value. The result is available in three forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as a vertex attribute value.
Input Parameters
• iter1: the max number of iterations for the first phase. Default value is 10
• iter2: the max number of iterations for the second phase. Default value is 10
• iter3: the max number of iterations for the refinement phase. Default value is 10
• split: the number of splits in phase 1. Increase the number to save memory, at the expense of having longer running time. Default value is 10.
• outputLevel: different detail level of community distribution shown in the result. Choice "0" only lists number of communities grouped by community size, while choice "1" also lists the members
• fComm(for file output only): the path to the output file for community labels
• fDist(for file output only): the path to the output file for community distribution
Result Size
V = number of vertices
Computational Complexity
O(V^2*L), V = number of vertices, L = (iter1 * iter2 + iter3) = total number of iterations
Graph Types
Undirected, unweighted edges

### Example

If we use louvain_parallel for social10 graph, it will give the same result as the result of as the connected components algorithm. The social26 graph is a connected graph which is quite dense. The connected components algorithm groups all the vertices into the same community, and label propagation does not consider the edge weight. On the contrary, louvain_parallel detects 7 communities in total, and the cluster distribution is shown below (csize is cluster size):
1
{
2
"@@clusterDist": [
3
{
4
"csize": 2,
5
"number": 1
6
},
7
{
8
"csize": 3,
9
"number": 2
10
},
11
{
12
"csize": 4,
13
"number": 2
14
},
15
{
16
"csize": 5,
17
"number": 2
18
}
19
]
Copied!

## Triangle Counting

### Description and Uses

Why triangles? Think of it in terms of a social network:
• If A knows B, and A also knows C, then we complete the triangle if B knows C. If this situation is common, it indicates a community with a lot of interaction.
• The triangle is in fact the smallest multi-edge "complete subgraph," where every vertex connects to every other vertex.
Triangle count (or density) is a measure of community and connectedness. In particular, it addresses the question of transitive relationships: If A--> B and B-->C, then what is the likelihood of A--> C?
Note that it is computing a single number: How many triangles are in this graph? It is not finding communities within a graph.
It is not common to count triangles in directed graphs, though it is certainly possible. If you choose to do so, you need to be very specific about the direction of interest: In a directed graph, If A--> B and B--> C, then
• if A-->C, we have a "shortcut".
• if C-->A, then we have a feedback loop.

### Specifications

We present two different algorithms for counting triangles. The first, tri_count(), is the classic edge-iterator algorithm. For each edge and its two endpoint vertices S and T, count the overlap between S's neighbors and T's neighbors.
1
tri_count()
2
tri_count_file(FILE filepath)
3
tri_count_attr()
Copied!
One side effect of the simple edge-iterator algorithm is that it ends up considering each of the three sides of a triangle. The count needs to be divided by 3, meaning we did 3 times more work than a smaller algorithm would have.
tri_count_fast() is a smarter algorithm which does two passes over the edges. In the first pass we mark which of the two endpoint vertices has fewer neighbors. In the second pass, we count the overlap only between marked vertices. The result is that we eliminate 1/3 of the neighborhood matching, the slowest 1/3, but at the cost of some additional memory.
1
tri_count_fast()
2
tri_count_fast_file(FILE filepath)
3
tri_count_fast_attr()
Copied!
Characteristic
Value
Result
Returns the number of triangles in the graph.
Input Parameters
None
Result Size
1 integer
Computational Complexity
O(V * E), V = number of vertices, E = number of edges
Graph Types
Undirected edges

### Example

In the social10 graph with Coworker edges, there are clearly 4 triangles.
1
{
2
"error": false,
3
"message": "",
4
"version": {
5
"schema": 0,
6
"api": "v2"
7
},
8
"results": [
9
{"num_triangles": 4}
10
]
11
}
Copied!

# Similarity Algorithms

There are many ways to measure the similarity between two vertices in a graph, but all of them compare either (1) the features of the vertices themselves, (2) the relationships of each of the two vertices, or (3) both. We use a graph called movie to demonstrate our similarities algorithms.

## Cosine Similarity of Neighborhoods, Single Source

### Description and Uses

To compare two vertices by cosine similarity, first selected properties of each vertex are represented as a vector. For example, a property vector for a Person vertex could have the elements (age, height, weight). Then the cosine function is applied to the two vectors.
The cosine similarity of two vectors A and B is defined as follows:
$cos(A,B)=\frac{A\cdot B}{||A||\cdot ||B||} = \frac{\sum_iA_i B_i}{\sqrt{\sum_iA^2_i}\sqrt{\sum_iB^2_i}}$
If A and B are identical, then cos(A, B) = 1. As expected for a cosine function, the value can also be negative or zero. In fact, cosine similarity is closely related to the Pearson correlation coefficient.
For this library function, the feature vector is the set of edge weights between the the two vertices and their neighbors.
In the movie graph shown in the figure below, there are Person vertices and Movie vertices. Every person may give rating to some of the movies. The rating score is stored on the Likes edge using the weight attribute. For example, in the graph below, Alex give a rating of 10 to the movie "Free Solo".
movie graph

### Specifications

1
cosine_nbor_ss(VERTEX source, INT topK)
2
cosine_nbor_ss_file(VERTEX source, INT topK, FILE filepath)
3
cosine_nbor_ss_attr(VERTEX source)
Copied!
Characteristic
Value
Result
the topK vertices in the graph which have the highest similarity scores, along with their scores.
The result is available in three forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as a vertex attribute value.
Input Parameters
• source: the source vertex
• topK: the number of vertices
• filepath (for file output only): the path to the output file
Result Size
topK
Computational Complexity
O(D^2), D = outdegree of vertex v
Graph Types
Undirected or directed edges, weighted edges
The output size is always K (if K <= N), so the algorithm may arbitrarily chose to output one vertex over another, if there are tied similarity scores.

### Example

Given one person's name, this algorithm calculates the cosine similarity between this person and each other person where there is at one movie they have both rated..
In the previous example, if the input is Alex, and topK is set to 5, then we calculate the cosine similarity between him and two other persons, Jing and Kevin. The JSON output shows the top k similar vertices and their similarity score in descending order. The output limit is 5 persons, but we have only 2 qualified persons:
1
[
2
{
3
"@@result_topk": [
4
{
5
"vertex1": "Alex",
6
"vertex2": "Jing",
7
"score": 0.42173
8
},
9
{
10
"vertex1": "Alex",
11
"vertex2": "Kevin",
12
"score": 0.14248
13
}
14
]
15
}
16
]
Copied!
The FILE version output is not necessarily in descending order. It looks like the following:
1
Vertex1,Vertex2,Similarity
2
Alex,Kevin,0.142484
3
Alex,Jing,0.421731
Copied!
The ATTR version inserts an edge into the graph with the similarity score as an edge attribute whenever the score is larger than zero. The result looks like this:
result of cosine_nbor_attr("Alex") for the movie graph

## Cosine Similarity of Neighborhoods, All Pairs

### Description and Uses

This algorithm computes the same similarity scores as the cosine similarity of neighborhoods, single source algorithm (cosine_nbor_ss), except that it considers ALL pairs of vertices in the graph (for the vertex and edge types selected by the user). Naturally, this algorithm will take longer to run. For very large and very dense graphs, this may not be a practical choice.

### Specifications

1
cosine_nbor_ap(INT topK)
2
cosine_nbor_ap_file(INT topK, FILE filepath)
3
cosine_nbor_ap_attr(INT topK)
Copied!
Characteristic
Value
Result
the topK vertex pairs in the graph which have the highest similarity scores, along with their scores.
The result is available in three forms:
• streamed out in JSON format
• written to a file in tabular format, or
• stored as a vertex attribute value.
Input Parameters
• topK: the number of vertex pairs
• filepath (for file output only): the path to the output file
Result Size
topK
Computational Complexity
O(E^2 / V), V = number of vertices, E = number of edges
Graph Types
Undirected or directed edges, weighted edges

### Example

Using the movie graph, calculate the cosine similarity between all pairs and show the top 5 pairs: cosine_nbor_ap(5). This is the JSON result:
1
[
2
{
3
"@@total_result": [
4
{
5
"vertex1": "Kat",
6
"vertex2": "Neol",
7
"score": 0.67509
8
},
9
{
10
"vertex1": "Jing",
11
"vertex2": "Neol",