# Graph Algorithms

{% content-ref url="graph-algorithms/1.dfs" %}
[1.dfs](https://soumyajit4419.gitbook.io/ds-algo/graph/graph-algorithms/1.dfs)
{% endcontent-ref %}

{% content-ref url="graph-algorithms/2.bfs" %}
[2.bfs](https://soumyajit4419.gitbook.io/ds-algo/graph/graph-algorithms/2.bfs)
{% endcontent-ref %}

{% content-ref url="graph-algorithms/3.prims-mst" %}
[3.prims-mst](https://soumyajit4419.gitbook.io/ds-algo/graph/graph-algorithms/3.prims-mst)
{% endcontent-ref %}

{% content-ref url="graph-algorithms/4.kruskal-mst" %}
[4.kruskal-mst](https://soumyajit4419.gitbook.io/ds-algo/graph/graph-algorithms/4.kruskal-mst)
{% endcontent-ref %}

{% content-ref url="graph-algorithms/5.dijkstras-algorithm" %}
[5.dijkstras-algorithm](https://soumyajit4419.gitbook.io/ds-algo/graph/graph-algorithms/5.dijkstras-algorithm)
{% endcontent-ref %}

{% content-ref url="graph-algorithms/6.-floyd-warshalls-algorithm-all-pair-sortest-path" %}
[6.-floyd-warshalls-algorithm-all-pair-sortest-path](https://soumyajit4419.gitbook.io/ds-algo/graph/graph-algorithms/6.-floyd-warshalls-algorithm-all-pair-sortest-path)
{% endcontent-ref %}

{% content-ref url="graph-algorithms/7.-topological-sort" %}
[7.-topological-sort](https://soumyajit4419.gitbook.io/ds-algo/graph/graph-algorithms/7.-topological-sort)
{% endcontent-ref %}

{% content-ref url="graph-algorithms/8.-find-if-the-given-edge-is-a-bridge-in-graph." %}
[8.-find-if-the-given-edge-is-a-bridge-in-graph.](https://soumyajit4419.gitbook.io/ds-algo/graph/graph-algorithms/8.-find-if-the-given-edge-is-a-bridge-in-graph.)
{% endcontent-ref %}