scalax.collection.GraphPredef

EdgeOut

trait EdgeOut[NI, +EI[X <: NI] <: EdgeLike[X], NO <: NodeOut[NI], +EO[X <: NO] <: EdgeLike[X]] extends GraphParamOut[NI, EI] with GraphParamEdge

NI

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

NO

the type of the nodes (vertices) this graph passes back.

Linear Supertypes
GraphParamEdge, GraphParamOut[NI, EI], GraphParam[NI, EI], AnyRef, Any
Known Subclasses
EdgeBase, EdgeImpl
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EdgeOut
  2. GraphParamEdge
  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 edge: EO[NO]

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 asEdgeT[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): asEdgeT.G.EdgeT

    Attributes
    protected[scalax.collection]

  7. final def asEdgeTProjection[N <: NI, E[X] <: EdgeLikeIn[X]]: EdgeT

    Attributes
    protected[scalax.collection]

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  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.EdgeT) ⇒ T, fb: (EdgeT) ⇒ T): T

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

    Definition Classes
    AnyRef → Any

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  16. final def isContaining[N <: NI, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

  17. def isEdge: Boolean

    Definition Classes
    GraphParamEdge

  18. def isIn: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  20. def isNode: Boolean

    Definition Classes
    GraphParamEdge

  21. def isOut: Boolean

    Definition Classes
    GraphParamOut → GraphParam

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

    Definition Classes
    AnyRef

  23. final def notify(): Unit

    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  25. def stringPrefix: String

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

    Definition Classes
    AnyRef

  27. final def toEdgeT[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (EdgeT) ⇒ toEdgeT.G.EdgeT): toEdgeT.G.EdgeT

  28. def toString(): String

    Definition Classes
    EdgeOut → AnyRef → Any

  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from GraphParamEdge

Inherited from GraphParamOut[NI, EI]

Inherited from GraphParam[NI, EI]

Inherited from AnyRef

Inherited from Any

Ungrouped