Results for “Std.DisjointSet.DisjointSet”

Use module:Std.List, kind:fn, or is:exact. Put a Pudu type after ::.

• Std.DisjointSet.DisjointSet

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

  type · Std.DisjointSet
• Std.DisjointSet.componentCount&Std.DisjointSet.DisjointSet -> Int

  Returns the number of disconnected components remaining.

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

  Returns the number of elements in the component containing x.

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

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

  fn · Std.DisjointSet
• Std.DisjointSet.createInt -> Std.DisjointSet.DisjointSet

  Allocates a disjoint-set forest of totalElements singleton components.

  fn · Std.DisjointSet
• Std.DisjointSet.elementCount&Std.DisjointSet.DisjointSet -> Int

  Returns the total number of elements tracked.

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

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

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

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

  fn · Std.DisjointSet