Skip to content
#

path-compression

Here is 1 public repository matching this topic...

Interactive union-find (disjoint set union) — union elements and watch trees merge, run find to watch path compression flatten a tree, check connectivity. Union by size + path compression give near-O(1) (inverse-Ackermann) operations. The structure behind Kruskal's MST and connected components. Runs in your browser.

  • Updated Jul 31, 2026
  • HTML

Improve this page

Add a description, image, and links to the path-compression topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the path-compression topic, visit your repo's landing page and select "manage topics."

Learn more