scalax.collection.constrained.mutable

Tree

object Tree extends CompanionAlias[UnDiEdge] with Serializable

Companion module for mutable undirected connected acyclic Graph.

Linear Supertypes
Serializable, Serializable, CompanionAlias[UnDiEdge], GraphConstrainedCompanionAlias[Graph, UnDiEdge], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Tree
  2. Serializable
  3. Serializable
  4. CompanionAlias
  5. GraphConstrainedCompanionAlias
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  6. def apply[N](elems: GraphParamIn[N, UnDiEdge]*)(implicit edgeManifest: Manifest[UnDiEdge[N]], config: GraphConfig): constrained.Graph[N, UnDiEdge]

    Definition Classes
    GraphConstrainedCompanionAlias

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def clone(): AnyRef

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

  9. def empty[N](implicit edgeManifest: Manifest[UnDiEdge[N]], config: GraphConfig): constrained.Graph[N, UnDiEdge]

    Definition Classes
    GraphConstrainedCompanionAlias

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

    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  12. def finalize(): Unit

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

  13. def from[N](nodes: Iterable[N], edges: Iterable[UnDiEdge[N]])(implicit edgeManifest: Manifest[UnDiEdge[N]], config: GraphConfig): constrained.Graph[N, UnDiEdge]

    Definition Classes
    GraphConstrainedCompanionAlias

  14. def fromStream[N](nodeStreams: Iterable[NodeInputStream[N]], nodes: Iterable[N], edgeStreams: Iterable[GenEdgeInputStream[N, UnDiEdge]], edges: Iterable[UnDiEdge[N]])(implicit edgeManifest: Manifest[UnDiEdge[N]], config: GraphConfig): constrained.Graph[N, UnDiEdge]

    Definition Classes
    GraphConstrainedCompanionAlias

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

    Definition Classes
    AnyRef → Any

  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  22. def toString(): String

    Definition Classes
    AnyRef → Any

  23. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Serializable

Inherited from Serializable

Inherited from CompanionAlias[UnDiEdge]

Inherited from GraphConstrainedCompanionAlias[Graph, UnDiEdge]

Inherited from AnyRef

Inherited from Any

Ungrouped