Breadth‑first Search (BFS) explores a graph level by level, visiting all neighbors of a node before moving to nodes farther away.
Depth‑first Search (DFS) explores a graph by recursively following each branch as far as possible before backtracking.
Kruskal’s algorithm builds a minimum‑weight spanning tree by repeatedly adding the cheapest edge that connects two distinct components.
