Union Find: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

6 May 2023

  • curprev 23:2123:21, 6 May 2023‎ Admin talk contribs‎ 2,301 bytes +53‎ No edit summary undo
  • curprev 23:1723:17, 6 May 2023‎ Admin talk contribs‎ 2,248 bytes +1,094‎ No edit summary undo
  • curprev 22:5022:50, 6 May 2023‎ Admin talk contribs‎ 1,154 bytes +1,154‎ Created page with "The disjoint-set data structure, also known as the union-find data structure, is used to keep track of a collection of non-overlapping sets or elements that are partitioned into disjoint subsets. The primary operations associated with this data structure are: * Find: Determine which subset an element belongs to. This is typically used to check if two elements are in the same subset. * Union: Join two subsets together, combining them into a single subset. The disjoint-..."
Retrieved from "https://wiki.usaco.fun/index.php/Union_Find"