---
title: "Algorithm Availability and Dependencies"
component: "graph-ml"
version: "3.10"
module: "intro"
html_url: "/graph-ml/3.10/intro/algorithm-table"
canonical_url: "https://www.tigergraph.com/docs/graph-ml/3.10/intro/algorithm-table"
markdown_url: "https://www.tigergraph.com/docs/graph-ml/3.10/intro/algorithm-table.md"
---

[View as HTML](https://www.tigergraph.com/docs/graph-ml/3.10/intro/algorithm-table)

# 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 data-driven requirements are listed with each algorithm.

**Maturity** \- The maturity of an algorithm is one of three classifications:

* **Alpha** \= basic functionality and testing
* **Beta** \= full-featured, well-tested
* **Production** \= full-featured, 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](https://www.tigergraph.com/docs/gui/4.3/graphstudio/write-queries.md#_create_a_query_or_add_a_query_from_the_algorithm_library).

**Packaged Template** \- Availability in TigerGraph's built-in package of templated algorithms with just-in-time compilation.

**UDF Required** \- This algorithm requires the installation of a custom user-defined function (UDF). If installed by GraphStudio or as a packaged template query, the UDF will be taken care of automatically.

> [!NOTE]
> 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 | [ArticleRank](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/article-rank.md) | Prod | Y | Y |  |  |
| Centrality | [Betweenness Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/betweenness-centrality.md) | Prod | Y | Y |  |  |
| Centrality | [Closeness Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/closeness-centrality.md) | Prod | Y | Y |  |  |
| Centrality | [Closeness Centrality, approximate](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/approximate-closeness-centrality.md) | Prod | Y |  |  |  |
| Centrality | [Degree Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/degree-centrality.md) | Prod | Y | Y |  |  |
| Centrality | [Degree Centrality, weighted](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/weighted-degree-centrality.md) | Prod | Y | Y |  |  |
| Centrality | [Eigenvector Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/eigenvector-centrality.md) | Prod | Y |  |  |  |
| Centrality | [Harmonic Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/harmonic-centrality.md) | Prod | Y |  |  |  |
| Centrality | [Influence Maximization](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/influence-maximization.md), CELF | Prod | Y |  |  |  |
| Centrality | [Influence Maximization](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/influence-maximization.md), greedy | Prod | Y |  |  |  |
| Centrality | [PageRank](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/pagerank.md) | Prod | Y | Y |  |  |
| Centrality | [PageRank, weighted](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/weighted-pagerank.md) | Prod | Y | Y |  |  |
| Centrality | [Personalized PageRank](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/personalized-pagerank.md) | Prod |  |  |  |  |
| Classification | [Greedy Graph Coloring](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/greedy-graph-coloring.md) | Prod | Y | Y |  |  |
| Classification | [k-Nearest Neighbors (Cross-Validation Version)](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/k-nearest-neighbors-cross-validation.md) | Prod | Y |  |  |  |
| Classification | [k-Nearest Neighbors (Batch Version)](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/k-nearest-neighbors-batch.md) | Prod | Y |  |  |  |
| Classification | [k-Nearest Neighbors (Cross-Validation Version)](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/k-nearest-neighbors-cross-validation.md) | Prod | Y |  |  | Y |
| Classification | [Maximal Independent Set](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/maximal-independent-set.md), deterministic | Prod | Y |  | Y |  |
| Community | [k-Core Decomposition](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/k-core-decomposition.md) | Beta | Y |  |  |  |
| Community | [Label Propagation](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/label-propagation.md) | Beta | Y | Y |  |  |
| Community | [Label Propogation, speaker-listener](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/slpa.md) | Beta |  | Y | Y |  |
| Community | [Local Clustering Coefficient](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/local-clustering-coefficient.md) | Beta | Y | Y |  |  |
| Community | [Louvain](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/louvain.md) | Beta | Y | Y |  |  |
| Community | [Strongly Connected Components](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/strongly-connected-components.md) | Prod | Y |  |  |  |
| Community | [SCC (Small-World Optimized)](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/scc-small-world.md) | Prod | Y | Y |  |  |
| Community | [Triangle Counting](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/triangle-counting.md) | Prod |  | Y |  |  |
| Community | [Triangle Counting](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/triangle-counting.md), fast | Prod | Y | Y |  |  |
| Community | [Weakly Connected Components](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/connected-components.md) | Prod | Y | Y |  |  |
| Community | [WCC (Small-World Optimized)](https://www.tigergraph.com/docs/graph-ml/3.10/community-algorithms/wcc-small-world.md) | Prod | Y |  |  |  |
| Graph ML | [Fast Random Projection](https://www.tigergraph.com/docs/graph-ml/3.10/node-embeddings/fast-random-projection.md) | Alpha | Y |  | Y |  |
| Graph ML | [Weisfeiler-Lehman Isomorphism](https://www.tigergraph.com/docs/graph-ml/3.10/classification-algorithms/weisfeiler-lehman.md) | Prod | Y | Y | Y |  |
| Path | [A\*](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/a-star.md) | Beta |  |  | Y |  |
| Path | [Breadth-First Search](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/bfs.md) | Beta | Y | Y |  |  |
| Path | [Cycle Detection](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/cycle-detection.md) | Beta | Y | Y |  |  |
| Path | [Estimated Diameter](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/estimated-diameter.md) | Beta |  |  |  | Y |
| Path | [Maximum Flow](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/max-flow.md) | Beta | Y |  |  |  |
| Path | [Minimum Spanning Forest](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/minimum-spanning-forest.md) | Beta | Y |  |  |  |
| Path | [Minimum Spanning Tree](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/minimum-spanning-tree.md) | Beta |  |  |  |  |
| Path | [Single-source Shortest Path (Unweighted)](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/single-source-shortest-path-unweighted.md) | Prod | Y |  |  |  |
| Path | [Single-source Shortest Path (Weighted)](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/single-source-shortest-path-weighted.md) | Prod |  |  |  |  |
| Similarity | [Cosine Similarity of Neighborhoods (All Pairs, Batch)](https://www.tigergraph.com/docs/graph-ml/3.10/similarity-algorithms/cosine-similarity-of-neighborhoods-batch.md) | Prod | Y | Y |  |  |
| Similarity | [Cosine Similarity of Neighborhoods (Single-Source)](https://www.tigergraph.com/docs/graph-ml/3.10/similarity-algorithms/cosine-similarity-of-neighborhoods-single-source.md) | Prod | Y |  |  |  |
| Similarity | [Jaccard Similarity of Neighborhoods (All Pairs, Batch)](https://www.tigergraph.com/docs/graph-ml/3.10/similarity-algorithms/jaccard-similarity-of-neighborhoods-batch.md) | Prod | Y |  |  |  |
| Similarity | [Jaccard Similarity of Neighborhoods (Single Source)](https://www.tigergraph.com/docs/graph-ml/3.10/similarity-algorithms/jaccard-similarity-of-neighborhoods-single-source.md) | Prod | Y |  |  |  |
| Similarity | [Vector Similarity](https://www.tigergraph.com/docs/gsql-ref/4.3/querying/func/vector-functions.md) | Beta |  | N/A | is a UDF |  |
| Topological Link Prediction | [Adamic Adar](https://www.tigergraph.com/docs/graph-ml/3.10/link-prediction/adamic-adar.md) | Prod | 3.9.2 | Y |  |  |
| Topological Link Prediction | [Common Neighbors](https://www.tigergraph.com/docs/graph-ml/3.10/link-prediction/common-neighbors.md) | Prod | 3.9.2 | Y |  |  |
| Topological Link Prediction | [Preferential Attachment](https://www.tigergraph.com/docs/graph-ml/3.10/link-prediction/preferential-attachment.md) | Prod | 3.9.2 | Y |  |  |
| Topological Link Prediction | [Resource Allocation](https://www.tigergraph.com/docs/graph-ml/3.10/link-prediction/resource-allocation.md) | Prod | 3.9.2 | Y |  |  |
| Topological Link Prediction | [Same Community](https://www.tigergraph.com/docs/graph-ml/3.10/link-prediction/same-community.md) | Prod | Y | Y |  |  |
| Topological Link Prediction | [Total Neighbors](https://www.tigergraph.com/docs/graph-ml/3.10/link-prediction/total-neighbors.md) | Prod | 3.9.2 | Y |  |  |
