scalax.collection.GraphPredef

NodeOut

trait NodeOut[NI] extends GraphParamOut[NI, Nothing] with GraphParamNode[NI]

NI

the type of the nodes (vertices) this graph is passed to by the user.

Linear Supertypes
GraphParamNode[NI], GraphParamOut[NI, Nothing], GraphParam[NI, Nothing], AnyRef, Any
Known Subclasses
InnerNodeImpl, InnerNodeImpl, InnerNodeLike, InnerNodeLike, InnerNodeLike, InnerNodeLike, InnerNodeLike, InnerNodeTraversalImpl, NodeBase, NodeBase, NodeBase, NodeBase
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NodeOut
  2. GraphParamNode
  3. GraphParamOut
  4. GraphParam
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def isContaining[N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

  2. abstract def value: NI

    Definition Classes
    GraphParamNode

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

    Definition Classes
    Any

  7. final def asNodeT[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): asNodeT.G.NodeT

    Attributes
    protected[scalax.collection]

  8. final def asNodeTProjection[N <: NI, E[X] <: EdgeLikeIn[X]]: NodeT

    Attributes
    protected[scalax.collection]

  9. def clone(): AnyRef

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

  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( classOf[java.lang.Throwable] )

  13. final def fold[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (fold.G.NodeT) ⇒ T, fb: (NodeT) ⇒ T): T

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

    Definition Classes
    AnyRef → Any

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  16. def isEdge: Boolean

    Definition Classes
    GraphParamNode

  17. def isIn: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  19. def isNode: Boolean

    Definition Classes
    GraphParamNode

  20. def isOut: Boolean

    Definition Classes
    GraphParamOut → GraphParam

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

    Definition Classes
    AnyRef

  22. final def notify(): Unit

    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  24. def stringPrefix: String

    Definition Classes
    GraphParamNode

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

    Definition Classes
    AnyRef

  26. final def toNodeT[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (NodeT) ⇒ toNodeT.G.NodeT): toNodeT.G.NodeT

  27. def toString(): String

    Definition Classes
    GraphParamNode → AnyRef → Any

  28. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from GraphParamNode[NI]

Inherited from GraphParamOut[NI, Nothing]

Inherited from GraphParam[NI, Nothing]

Inherited from AnyRef

Inherited from Any

Ungrouped