final class Runner[U] extends AnyRef
Contains algorithms and local values to be used by the algorithms. Last target reusability and best possible run-time performance.
- Attributes
- protected
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Runner
- AnyRef
- Any
Implicitly
- by anyToNode
- by CollectionsHaveToParArray
- by EdgeAssoc
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isIn: Boolean
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isOut: Boolean
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
- def maxDepth: Int
-
val
n1: This.Runner[U]
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to EdgeAssoc[This.Runner[U]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to CollectionsHaveToParArray[This.Runner[U], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.Runner[U]) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
val
value: This.Runner[U]
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to EdgeAssoc[This.Runner[U]] 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 This.Runner[U] to EdgeAssoc[This.Runner[U]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
Shadowed Implicit Value Members
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(runner: OuterNode[This.Runner[U]]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
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
.