Breadth-First Search (BFS)

Depth-First Search (DFS)

Dijkstra's Algorithm (shortest path)

Bellman-Ford Algorithm (shortest path with negative weights)

Floyd-Warshall Algorithm (all-pairs shortest paths)

Kruskal's Algorithm (minimum spanning tree)

Prim's Algorithm (minimum spanning tree)