26 lines
1.4 KiB
Markdown
26 lines
1.4 KiB
Markdown
---
|
|
title: Graph algorithms
|
|
---
|
|
## Graph algorithms
|
|
|
|
Graph algorithms are a set of instructions that traverse (visits nodes of a) graph.
|
|
|
|
Some algorithms are used to find a specific node or the path between two given nodes.
|
|
|
|
### Why Graph Algorithms are Important
|
|
|
|
A graphs are very useful data structures which can be to model various problems. These algorithms have direct applications on Social Networking sites, State Machine modeling and many more.
|
|
|
|
### Some Common Graph Algorithms
|
|
Some of the most common graph algorithms are:
|
|
|
|
<a href='https://github.com/freecodecamp/guides/computer-science/data-structures/graphs/index.md' target='_blank' rel='nofollow'>Graphs</a>
|
|
|
|
<a href='https://github.com/freecodecamp/guides/tree/master/src/pages/algorithms/graph-algorithms/breadth-first-search/index.md' target='_blank' rel='nofollow'>Breadth First Search (BFS)</a>
|
|
|
|
<a href='https://github.com/freecodecamp/guides/tree/master/src/pages/algorithms/graph-algorithms/depth-first-search/index.md' target='_blank' rel='nofollow'>Depth First Search (DFS)</a>
|
|
|
|
<a href='https://github.com/freecodecamp/guides/tree/master/src/pages/algorithms/graph-algorithms/dijkstra/index.md' target='_blank' rel='nofollow'>Dijkstra</a>
|
|
|
|
<a href='https://github.com/freecodecamp/guides/tree/master/src/pages/algorithms/graph-algorithms/floyd-warshall-algorithm/index.md' target='_blank' rel='nofollow'>Floyd-Warshall Algorithm</a>
|