DFS

Bipartite Graph

BFS

Union Find

Kruskal’s (Minimum Spanning Tree)

Prim’s (Minimum Spanning Tree)

Dijkstra’s

Bellman Ford

Floyd Warshall

Kahn’s Topological Sort

Hierholzer’s (Eulerian Path)