case class OuterNode[NI](value: NI) extends InParam[NI, Nothing] with NodeParam[NI] with Product with Serializable
- NI
the type of the nodes (vertices) this graph is passed to by the user.
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- OuterNode
- Serializable
- Serializable
- Product
- Equals
- NodeParam
- InParam
- Param
- AnyRef
- Any
Implicitly
- by EdgeAssoc
- by CollectionsHaveToParArray
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new OuterNode(value: NI)
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (OuterNode[NI], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def ensuring(cond: (OuterNode[NI]) ⇒ Boolean, msg: ⇒ Any): OuterNode[NI]
- def ensuring(cond: (OuterNode[NI]) ⇒ Boolean): OuterNode[NI]
- def ensuring(cond: Boolean, msg: ⇒ Any): OuterNode[NI]
- def ensuring(cond: Boolean): OuterNode[NI]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
isDefined: Boolean
- Definition Classes
- Param
-
def
isEdge: Boolean
- Definition Classes
- NodeParam
- def isIn: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNode: Boolean
- Definition Classes
- NodeParam
- def isOut: Boolean
-
val
n1: OuterNode[NI]
- Implicit
- This member is added by an implicit conversion from OuterNode[NI] to EdgeAssoc[OuterNode[NI]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
stringPrefix: String
- Definition Classes
- NodeParam
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from OuterNode[NI] to CollectionsHaveToParArray[OuterNode[NI], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (OuterNode[NI]) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toString(): String
- Definition Classes
- NodeParam → AnyRef → Any
- val value: NI
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from OuterNode[NI] to EdgeAssoc[OuterNode[NI]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from OuterNode[NI] to EdgeAssoc[OuterNode[NI]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def →[B](y: B): (OuterNode[NI], B)
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.