Class

ap.basetypes

UnionFind

Related Doc: package basetypes

Permalink

class UnionFind[D] extends Cloneable

A simple, textbook implementation of a union-find data structure.

Linear Supertypes
Cloneable, Cloneable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. UnionFind
  2. Cloneable
  3. Cloneable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new UnionFind()

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def apply(d: D): D

    Permalink

    Find the representing element for d.

    Find the representing element for d. Two elements belong to the same set iff they have the same representative.

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): UnionFind[D]

    Permalink
    Definition Classes
    UnionFind → AnyRef
  7. def contains(d: D): Boolean

    Permalink

    Check whether an element is already present in the forest.

  8. def elements: Iterator[D]

    Permalink

    Iterator over all elements of this forest.

  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. def makeSet(d: D): Unit

    Permalink

    Add a new element to the forest.

  16. def makeSetIfNew(d: D): Unit

    Permalink

    Add a new element to the forest; the operation has no effect if the element is already present in the forest.

  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. def representatives: Iterator[D]

    Permalink

    Iterator over the elements representing sets; exactly one object will be enumerated for each set.

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  22. def toString(): String

    Permalink
    Definition Classes
    UnionFind → AnyRef → Any
  23. def union(d: D, e: D): Unit

    Permalink

    Join two sets.

  24. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Cloneable

Inherited from Cloneable

Inherited from AnyRef

Inherited from Any

Ungrouped