Algorithm Availability and Dependencies
The following table lists several key characteristics of each algorithm,
Besides these requirements, each algorithm is designed to work with certain types of graph data, such as directed edges vs. undirected edges. Those datadriven requirements are listed with each algorithm.
Maturity  The maturity of an algorithm is one of three classifications:

Alpha = basic functionality and testing

Beta = fullfeatured, welltested

Production = fullfeatured, stable, rigorously tested, optimized for speed and resource efficiency, suitable for production use
GraphStudio  Availability for easy installation as one of GraphStudio’s preloaded algorithms.
Packaged Template  Availability in TigerGraph’s builtin package of templated algorithms with justintime compilation.
UDF Required  This algorithm requires the installation of a custom userdefined function (UDF). If installed by GraphStudio or as a packaged template query, the UDF will be taken care of automatically.
For security reasons, the ability to install a UDF is disabled by default. Your system administrator can enable this capability if appropriate. 
Subquery Required  This algorithm requires the installation of a custom subquery.
Category  Algorithm  Maturity  Graph Studio  Packaged Template  UDF Required  Subquery Required 

Centrality 
Prod 
Y 
Y 

Centrality 
Prod 
Y 
Y 

Centrality 
Prod 
Y 
Y 

Centrality 
Prod 
Y 

Centrality 
Prod 
Y 
Y 

Centrality 
Prod 
Y 
Y 

Centrality 
Prod 
Y 

Centrality 
Prod 
Y 

Centrality 
Influence Maximization, CELF 
Prod 
Y 

Centrality 
Influence Maximization, greedy 
Prod 
Y 

Centrality 
Prod 
Y 
Y 

Centrality 
Prod 
Y 
Y 

Centrality 
Prod 

Classification 
Prod 
Y 
Y 

Classification 
Prod 
Y 

Classification 
Prod 
Y 

Classification 
Prod 
Y 
Y 

Classification 
Maximal Independent Set, deterministic 
Prod 
Y 
Y 

Community 
Beta 
Y 

Community 
Beta 
Y 
Y 

Community 
Beta 
Y 
Y 

Community 
Beta 
Y 
Y 

Community 
Beta 
Y 
Y 

Community 
Prod 
Y 

Community 
Prod 
Y 
Y 

Community 
Prod 
Y 

Community 
Triangle Counting, fast 
Prod 
Y 
Y 

Community 
Prod 
Y 
Y 

Community 
Prod 
Y 

Graph ML 
Alpha 
Y 
Y 

Graph ML 
Prod 
Y 
Y 
Y 

Path 
Beta 
Y 

Path 
Beta 
Y 
Y 

Path 
Beta 
Y 
Y 

Path 
Beta 
Y 

Path 
Beta 
Y 

Path 
Beta 
Y 

Path 
Beta 

Path 
Prod 
Y 

Path 
Prod 

Similarity 
Prod 
Y 
Y 

Similarity 
Prod 
Y 

Similarity 
Beta 
Y 

Similarity 
Prod 
Y 

Similarity 
Prod 
Y 

Similarity 
Beta 
Y 

Similarity 
Beta 
Y 

Topological Link Prediction 
Prod 
3.9.2 
Y 

Topological Link Prediction 
Prod 
3.9.2 
Y 

Topological Link Prediction 
Prod 
3.9.2 
Y 

Topological Link Prediction 
Prod 
3.9.2 
Y 

Topological Link Prediction 
Prod 
Y 
Y 

Topological Link Prediction 
Prod 
3.9.2 
Y 