Std.DisjointSet

8 public declarations

• componentCount&Std.DisjointSet.DisjointSet -> Int

  Returns the number of disconnected components remaining.

  fn
• componentSize&Std.DisjointSet.DisjointSet -> Int -> Option[Int]

  Returns the number of elements in the component containing `x`.

  fn
• connected&Std.DisjointSet.DisjointSet -> Int -> Int -> Option[Bool]

  Tests whether elements `x` and `y` belong to the same component.

  fn
• createInt -> Std.DisjointSet.DisjointSet

  Allocates a disjoint-set forest of `totalElements` singleton components.

  fn
• DisjointSet

  A low-level, flat-array Disjoint-Set (Union-Find) with path halving and union-by-rank.

  type
• elementCount&Std.DisjointSet.DisjointSet -> Int

  Returns the total number of elements tracked.

  fn
• find&Std.DisjointSet.DisjointSet -> Int -> (Std.DisjointSet.DisjointSet, Option[Int])

  Finds the root representative of element `x` using iterative path halving.

  fn
• union&Std.DisjointSet.DisjointSet -> Int -> Int -> Option[Std.DisjointSet.DisjointSet]

  Merges the sets containing elements `x` and `y` using union-by-rank.

  fn