scalation.graphalytics

ColorTree

Related Doc: package graphalytics

class ColorTree extends AnyRef

The ColorTree class provides a data structure for multi-way trees with colored nodes.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ColorTree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ColorTree(minOut: Int = 0, maxOut: Int = 2)

    minOut

    the minimum number of children allowed (0 => binary tree)

    maxOut

    the maximum number of children allowed (2 => binary tree)

Value Members

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

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. def add(p: TreeNode): TreeNode

    Create a new node, link it in the tree and return it.

    Create a new node, link it in the tree and return it.

    p

    the parent node (null for root)

  5. def apply(i: Int): TreeNode

    Return the ith node.

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  11. def genPre(depth: Int, p: TreeNode, lev: Int, ord: Int, sibs: Int): Unit

    Recursive helper method for generating a tree using a pre-order traversal.

    Recursive helper method for generating a tree using a pre-order traversal.

    depth

    the depth of the tree

    p

    the parent node

    lev

    the level of the node

    ord

    the birth order of the node

    sibs

    the number of siblings

  12. def genTree(depth: Int): Unit

    Randomly generate a color tree.

    Randomly generate a color tree.

    depth

    the depth of the tree

  13. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  19. def printTree: Unit

    Print the tree.

  20. val root: TreeNode

  21. def showAnimation: Unit

    Animate the generation of the color tree.

  22. def size: Int

    Return the number of nodes in the color tree.

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

    Definition Classes
    AnyRef

  24. def toString(): String

    Definition Classes
    AnyRef → Any

  25. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  27. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped