Disjoint-set data structure

Disjoint-set data structure

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of disjoint (non-overlapping) sets. Equivalently, it stores a partition of a set into disjoint subsets.

Excerpt from the Wikipedia article “Disjoint-set data structure”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Disjoint-set data structure to your collection.

Play for free

Related cards