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

# Graph Algorithms

{% content-ref url="/pages/-MIm5qSSyS1XRAoR77XV" %}
[1.DFS](/ds-algo/graph/graph-algorithms/1.dfs.md)
{% endcontent-ref %}

{% content-ref url="/pages/-MIm6-HEJfyK9VOohJbu" %}
[2.BFS](/ds-algo/graph/graph-algorithms/2.bfs.md)
{% endcontent-ref %}

{% content-ref url="/pages/-MIm4\_O3fHg4Mt-E4Phy" %}
[3.Prim's MST](/ds-algo/graph/graph-algorithms/3.prims-mst.md)
{% endcontent-ref %}

{% content-ref url="/pages/-MJHnJ4wzLIcQO43Pdl9" %}
[4.Kruskal (MST)](/ds-algo/graph/graph-algorithms/4.kruskal-mst.md)
{% endcontent-ref %}

{% content-ref url="/pages/-MPiXRkxoeo3s7NuYJLf" %}
[5.Dijkstra’s Algorithm(Single Source Shortest Path)](/ds-algo/graph/graph-algorithms/5.dijkstras-algorithm.md)
{% endcontent-ref %}

{% content-ref url="/pages/-MbD8km5P0HSpG4ULN9y" %}
[6. Floyd Warshall's Algorithm(All Pair Sortest Path)](/ds-algo/graph/graph-algorithms/6.-floyd-warshalls-algorithm-all-pair-sortest-path.md)
{% endcontent-ref %}

{% content-ref url="/pages/-MdVJ2\_lY6Ns60dFisAO" %}
[7. Topological Sort](/ds-algo/graph/graph-algorithms/7.-topological-sort.md)
{% endcontent-ref %}

{% content-ref url="/pages/XDu8zVHcEzpeaEt2DQSU" %}
[8. Find if the given edge is a bridge in graph.](/ds-algo/graph/graph-algorithms/8.-find-if-the-given-edge-is-a-bridge-in-graph..md)
{% endcontent-ref %}