Data Structures and Algorithms · Graphs

Union-find

A structure that tracks which elements belong to the same group and merges groups quickly.

Also known as: disjoint set union, DSU, path compression.

Start a lesson on Union-find

Learn first

• Graph representations: Storing a graph's vertices and edges as an adjacency matrix or adjacency list.

Leads to

• Minimum spanning trees: The cheapest set of edges that connects every vertex with no cycles.

Related topics

• Minimum spanning trees: The cheapest set of edges that connects every vertex with no cycles.
• Topological sort: Ordering the vertices of a directed acyclic graph so every edge points forward.