Source: https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/
Documentation version: v5.3.2

# Algorithms overview

The following algorithms are grouped by the problem they solve.

Before running an algorithm for the first time, follow [Prepare algorithm sample data](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/prepare-data/) to check the directory mount. Each algorithm page provides CSV downloads, import statements, and instructions for viewing results.

 | Category | Algorithm
 | Centrality | [PageRank](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/pagerank/)
 | Centrality | [Personalized PageRank (PPR)](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/ppr/)
 | Centrality | [Degree Centrality](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/degree_centrality/)
 | Centrality | [Closeness Centrality](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/closeness_centrality/)
 | Centrality | [Betweenness Centrality](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/betweenness_centrality/)
 | Centrality | [HITS](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/hits/)
 | Path finding | [Single-Source Shortest Paths (SSSP)](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/sssp/)
 | Path finding | [Breadth-First Search (BFS)](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/bfs/)
 | Path finding | [Cycle Detection](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/cycle_detection/)
 | Path finding | [All-Pairs Shortest Path](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/all_pairs_shortest_path/)
 | Path finding | [A* Shortest Path](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/astar_shortest_path/)
 | Path finding | [Depth-First Search](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/depth_first_search/)
 | Path finding | [Dijkstra Shortest Path](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/dijkstra_shortest_path/)
 | Path finding | [K-Hop Traversal](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/k_hop/)
 | Path finding | [Maximum Flow](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/maximum_flow/)
 | Path finding | [Minimum Spanning Tree](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/minimum_spanning_tree/)
 | Path finding | [Random Walk](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/random_walk/)
 | Path finding | [Single-Pair Shortest Path](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/single_pair_shortest_path/)
 | Community detection | [Weakly Connected Components (WCC)](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/wcc/)
 | Community detection | [Label Propagation Algorithm (LPA)](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/lpa/)
 | Community detection | [Louvain Community Detection](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/louvain/)
 | Community detection | [Clustering Coefficient](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/clustering_coefficient/)
 | Community detection | [HANP](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/hanp/)
 | Community detection | [Infomap](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/infomap/)
 | Community detection | [K-Core](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/k_core/)
 | Community detection | [K-Means](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/k_means/)
 | Community detection | [Strongly Connected Components](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/strong_connected_component/)
 | Community detection | [Triangle Count](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/triangle_count/)
 | Similarity | [Jaccard Similarity](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/jaccard/)
 | Similarity | [Cosine Similarity](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/cosine_similarity/)
 | Node embedding | [FastRP](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/fastrp/)
 | Node embedding | [GraphSAGE](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/graphsage/)
 | Topological link prediction | [Adamic-Adar](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/adamic_adar/)
 | Topological link prediction | [Common Neighbors](https://dev-docs.nebula-graph.io/v5.3.2/analytic/algorithms/common_neighbors/)