Graph Algorithms

Graph algorithms are algorithms that accept (or work on) Graphs as their input. Some require the graph to be weighted, connected, etc.

For Traversing Graphs §

• Breadth First Search (BFS)
• Depth First Search (DFS)
• Best First Search

For obtaining the Minimum Spanning Tree (MST) §

• Prim’s Algorithm
• Kruskal’s Algorithm

Single-Source Shortest Path problem#computer-science §

• Dijkstra’s Algorithm
• A-star Algorithm
• Bellman-Ford Algorithm

All Pairs Shortest Path problem §

• Floyd-Warshall’s Algorithm

Other Algorithms §

• Graph Colouring Problem
• Page Rank Algorithm

---