---
title: "Pathfinding Algorithms"
description: "Overview of pathfinding algorithms."
component: "graph-ml"
version: "3.10"
module: "pathfinding-algorithms"
html_url: "/graph-ml/3.10/pathfinding-algorithms/"
canonical_url: "https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/"
markdown_url: "https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/index.md"
---

[View as HTML](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/)

# Pathfinding Algorithms

Pathfinding algorithms find the best path(s) between two vertices or among a set of vertices according to a particular rule (shortest unweighted, shortest weighted, lowest cost tree).

The TigerGraph Graph Data Science Library provides the following pathfinding algorithms:

* [A\*](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/a-star.md)
* [All-Pairs Shortest Path](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/all-pairs-shortest-path.md)
* [Breadth-First Search](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/bfs.md)
* [Cycle Detection](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/cycle-detection.md)
* [Estimated Diameter](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/estimated-diameter.md)
* [Maximum Flow](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/max-flow.md)
* [Minimum Spanning Forest](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/minimum-spanning-forest.md)
* [Minimum Spanning Tree](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/minimum-spanning-tree.md)
* [Single-source Shortest Path (Unweighted)](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/single-source-shortest-path-unweighted.md)
* [Single-source Shortest Path (Weighted)](https://www.tigergraph.com/docs/graph-ml/3.10/pathfinding-algorithms/single-source-shortest-path-weighted.md)
