trait
InnerEdgeParam[NI, +EI[X <: NI] <: EdgeLike[X], NO <: InnerNodeParam[NI], +EO[X <: NO] <: EdgeLike[X]] extends OutParam[NI, EI] with EdgeParam
Abstract Value Members
-
abstract
def
edge: EO[NO]
Concrete Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
def
->[B](y: B): (InnerEdgeParam[NI, EI, NO, EO], B)
-
-
final
def
==(arg0: Any): Boolean
-
final
def
asEdgeT[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): asEdgeT.G.EdgeT
-
final
def
asEdgeTProjection[N <: NI, E[X] <: EdgeLikeIn[X]]: EdgeT
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
-
-
-
-
def
finalize(): Unit
-
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
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isContaining[N <: NI, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
-
def
isDefined: Boolean
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
stringPrefix: String
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
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
-
def
toString(): String
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]
-
def
~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]
-
def
→[B](y: B): (InnerEdgeParam[NI, EI, NO, EO], B)
Shadowed Implicit Value Members
-
def
isDefined: Boolean
-
-
-
-
-
val
self: Any
-
val
self: Any
-
def
stringPrefix: String
-
def
toString(): String
Inherited from Param[NI, EI]
the type of the nodes (vertices) this graph is passed to by the user.
the type of the nodes (vertices) this graph passes back.