renesca.graph

Node

Related Docs: object Node | package graph

class Node extends AnyRef

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

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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def canEqual(other: Any): Boolean

  6. def changes: Seq[GraphChange]

  7. def clone(): AnyRef

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

  8. def degree(implicit graph: Graph): Int

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

    Definition Classes
    AnyRef

  10. def equals(other: Any): Boolean

    Definition Classes
    Node → AnyRef → Any

  11. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Definition Classes
    Node → AnyRef → Any

  14. val id: Id

  15. def inDegree(implicit graph: Graph): Int

  16. def inRelations(implicit graph: Graph): Set[Relation]

  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  18. val labels: NodeLabels

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

    Definition Classes
    AnyRef

  20. def neighbours(implicit graph: Graph): Set[Node]

  21. final def notify(): Unit

    Definition Classes
    AnyRef

  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  23. def outDegree(implicit graph: Graph): Int

  24. def outRelations(implicit graph: Graph): Set[Relation]

  25. def predecessors(implicit graph: Graph): Set[Node]

  26. val properties: Properties

  27. def relations(implicit graph: Graph): Set[Relation]

  28. def successors(implicit graph: Graph): Set[Node]

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

    Definition Classes
    AnyRef

  30. def toString(): String

    Definition Classes
    Node → AnyRef → Any

  31. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped