path-compression

Here are 6 public repositories matching this topic...

seung-lab / connected-components-3d

Connected components on discrete and continuous multilabel 3D & 2D images. Handles 26, 18, and 6 connected variants; periodic boundaries (4, 8, & 6)

Updated Jun 17, 2026
C++

saldisobi / kotlinAlgo

Star

Data Structures and Algorithms in Kotlin

Updated Nov 25, 2019
Kotlin

kafkasl / golang-ads

Sponsor

Star

Golang Advanced Data Structures

golang trie frequent-itemsets union-find advanced-data-structures trie-structure skip-list patricia-trie path-compression

Updated Jun 20, 2018
Go

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.

visualization javascript computer-science algorithms interactive data-structures disjoint-set union-find dsu path-compression