Concepts3
⚙️AlgorithmIntermediate
Breadth-First Search (BFS)
Breadth-First Search (BFS) explores a graph level by level, visiting all vertices at distance d from the source before any at distance d+1.
#bfs#breadth first search#graph traversal+12
⚙️AlgorithmIntermediate
Depth-First Search (DFS)
Depth-First Search (DFS) explores a graph by going as deep as possible along each path before backtracking.
#depth-first search#dfs#graph traversal+12
🗂️Data StructureIntermediate
Disjoint Set Union (Union-Find)
Disjoint Set Union (Union-Find) maintains a collection of non-overlapping sets and supports fast merging and membership queries.
#disjoint set union#union-find#path compression+11