An idiomatic implementation of a weighted Union Find data structure with path compression in Go.
-
Updated
Jul 26, 2021 - Go
#
union-find
Here are 17 public repositories matching this topic...
Basic data structures and operations written in Go, such as trie, bloom filter union&find etc.
go golang stack queue lru bloom-filter trie data-structures dfs binary-search-tree red-black-tree heap bfs lru-cache union-find
-
Updated
Jul 28, 2021 - Go
A collection of data structures implemented in Go.
go golang linked-list stack queue algorithms priority-queue data-structures binary-search-tree heap binary-heap bst hash-table disjoint-set min-heap union-find doubly-linked-list suffix-array fenwick-tree min-priority-queue
-
Updated
Feb 11, 2022 - Go
Data structures implementations in Go
go golang list stack queue datastructures data-structures binary-search-tree abstract-data-types dequeue union-find
-
Updated
Dec 23, 2021 - Go
Playing with data structures and algorithms in Go 😄
-
Updated
Apr 30, 2019 - Go
A Go implementation of a union-find data structure
-
Updated
Mar 22, 2017 - Go
High performance and easy to use datastructure packages for Golang
go golang stack packages queue algorithms datastructures trie priority-queue linkedlist disjoint-set union-find minheap maxheap
-
Updated
Feb 2, 2021 - Go
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
Disjoint set union (Union Find) performance focused implementation in Golang
-
Updated
Dec 20, 2024 - Go
disjoint set - union / find
-
Updated
Jan 22, 2019 - Go
Improve this page
Add a description, image, and links to the union-find topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the union-find topic, visit your repo's landing page and select "manage topics."