| Dijkstra’s Algorithm | Finds the shortest paths between nodes in a graph. |
| A* Search Algorithm | Finds the most efficient path in a graph with respect to a heuristic. |
| Bellman-Ford Algorithm | Computes shortest paths in a weighted graph (negative weights allowed). |
| Floyd–Warshall Algorithm | Finds shortest paths in a weighted graph with positive or negative edge weights. |
| Prim’s Algorithm | A greedy algorithm that finds a minimum spanning tree for a weighted graph. |
| Kruskal’s Algorithm | Finds the minimum spanning tree in an undirected graph. |
| Johnson’s Algorithm | All pairs shortest path algorithm in sparse directed graphs. |
| Tarjan’s Algorithm | Efficiently finds the strongly connected components of a graph. |
| Ford–Fulkerson Algorithm | Computes the maximum flow in a graph. |
| Edmonds–Karp Algorithm | Implementation of Ford–Fulkerson method for computing maximum flow. |
| Hopcroft–Karp Algorithm | Finds maximum cardinality matching in bipartite graphs. |
| Borůvka’s Algorithm | Computes the minimum spanning tree in a graph. |
| Stoer–Wagner Algorithm | Computes the minimum cut of a graph. |
| PageRank Algorithm | Ranks webpages or nodes in a graph according to their importance. |
| Breadth-First Search (BFS) | An algorithm for traversing or searching tree or graph data structures. |
| Depth-First Search (DFS) | An algorithm for traversing or searching tree or graph data structures. |
| Kosaraju’s Algorithm | Finds all strongly connected components in a directed graph. |
| Union-Find Algorithm | Data structure to manage a partition of a set into disjoint subsets. |
| Topological Sort | Linear ordering of the vertices in a graph. |
| Maximum Bipartite Matching | Finds the largest possible matching in a bipartite graph. |
