> For the complete documentation index, see [llms.txt](https://liuzhenglaichn.gitbook.io/algorithm/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://liuzhenglaichn.gitbook.io/algorithm/graph.md).

# Graph

- [Minimum Spanning Tree](https://liuzhenglaichn.gitbook.io/algorithm/graph/minimum-spanning-tree.md)
- [Kruskal](https://liuzhenglaichn.gitbook.io/algorithm/graph/minimum-spanning-tree/kruskal.md)
- [Prim](https://liuzhenglaichn.gitbook.io/algorithm/graph/minimum-spanning-tree/prim.md)
- [Shortest Path](https://liuzhenglaichn.gitbook.io/algorithm/graph/shortest-path.md)
- [Bellman Ford](https://liuzhenglaichn.gitbook.io/algorithm/graph/shortest-path/bellman-ford.md)
- [Dijkstra](https://liuzhenglaichn.gitbook.io/algorithm/graph/shortest-path/dijkstra.md)
- [Floyd Warshall](https://liuzhenglaichn.gitbook.io/algorithm/graph/shortest-path/floyd-warshall.md)
- [Johnson](https://liuzhenglaichn.gitbook.io/algorithm/graph/shortest-path/johnson.md)
- [Shortest Path Faster Algorithm](https://liuzhenglaichn.gitbook.io/algorithm/graph/shortest-path/shortest-path-faster-algorithm.md)
- [Bi Directional Breadth First Search](https://liuzhenglaichn.gitbook.io/algorithm/graph/bi-directional-breadth-first-search.md)
- [Bipartite](https://liuzhenglaichn.gitbook.io/algorithm/graph/bipartite.md)
- [Breadth First Search](https://liuzhenglaichn.gitbook.io/algorithm/graph/breadth-first-search.md)
- [Component Coloring](https://liuzhenglaichn.gitbook.io/algorithm/graph/component-coloring.md)
- [Component Count](https://liuzhenglaichn.gitbook.io/algorithm/graph/component-count.md)
- [Depth First Search](https://liuzhenglaichn.gitbook.io/algorithm/graph/depth-first-search.md)
- [Eulerian Path](https://liuzhenglaichn.gitbook.io/algorithm/graph/eulerian-path.md)
- [Maximum Bipartite Matching](https://liuzhenglaichn.gitbook.io/algorithm/graph/maximum-bipartite-matching.md)
- [Tarjan](https://liuzhenglaichn.gitbook.io/algorithm/graph/tarjan.md)
- [Topological Sort](https://liuzhenglaichn.gitbook.io/algorithm/graph/topological-sort.md)
- [Tree Diameter](https://liuzhenglaichn.gitbook.io/algorithm/graph/tree-diameter.md)
- [Tree Ring Order Traversal](https://liuzhenglaichn.gitbook.io/algorithm/graph/tree-ring-order-traversal.md)