7
Union-Find Disjoint Sets (UFDS)
source link: https://visualgo.net/en/ufds?slide=1
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Union-Find Disjoint Sets (UFDS)
slowfast
01r: 123r: 24r: 15r: 26r: 178r: 19101112111111111
slide 1 (3%)
The Union-Find Disjoint Sets (UFDS) data structure is used to model a collection of disjoint sets, which is able to efficiently (i.e., in nearly constant time) determine which set an item belongs to, test if two items belong to the same set, and union two disjoint sets into one when needed. It can be used to find connected components in an undirected graph, and can hence be used as part of Kruskal's algorithm for the Minimum Spanning Tree (MST) problem.
Remarks: By default, we show e-Lecture Mode for first time (or non logged-in) visitor.
Please login if you are a repeated visitor or register for an (optional) free account first.
X Esc
Next PgDn
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK