Implementation of Disjoint-set data structure algorithm (also called a union–find data structure or merge–find set) with TypeScript
-
Updated
Sep 7, 2022 - TypeScript
Implementation of Disjoint-set data structure algorithm (also called a union–find data structure or merge–find set) with TypeScript
A disjoint-set data structure stores a collection of disjoint (non-overlapping) sets.
Group similar items together.
Add a description, image, and links to the disjoint-set topic page so that developers can more easily learn about it.
To associate your repository with the disjoint-set topic, visit your repo's landing page and select "manage topics."