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
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to any2stringadd[This.Runner[U]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
->[B](y: B): (This.Runner[U], B)
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to ArrowAssoc[This.Runner[U]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(): Option[NodeT]
- Attributes
- protected[scalax.collection.TraverserImpl.Impl]
- Annotations
- @inline()
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
bfs(maybeHandle: Option[Handle] = None): Option[NodeT]
- Attributes
- protected[scalax.collection]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
dfs[U](maybeHandle: Option[Handle] = None): Option[NodeT]
- Attributes
- protected[scalax.collection]
- Annotations
- @inline()
-
def
dfsStack[U](nodeUpVisitor: (NodeT) ⇒ U = empty, maybeHandle: Option[Handle] = None): (Option[NodeT], ArrayStack[Element])
- returns
(node stopped at, stack of ...)
- Attributes
- protected[scalax.collection]
-
def
dfsTarjan(maybeHandle: Option[Handle] = None, nodeUpVisitor: (NodeT) ⇒ U = empty): Iterable[GraphTraversalImpl.Component]
- Attributes
- protected[scalax.collection]
-
def
dfsWGB(globalState: Array[Handle] = Array.empty[Handle], mustContain: Option[NodeT] = None): Option[(NodeT, ArrayStack[CycleStackElem])]
Tail-recursive white-gray-black DFS implementation for cycle detection.
Tail-recursive white-gray-black DFS implementation for cycle detection.
- Attributes
- protected[scalax.collection]
-
def
ensuring(cond: (This.Runner[U]) ⇒ Boolean, msg: ⇒ Any): This.Runner[U]
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to Ensuring[This.Runner[U]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (This.Runner[U]) ⇒ Boolean): This.Runner[U]
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to Ensuring[This.Runner[U]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): This.Runner[U]
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to Ensuring[This.Runner[U]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): This.Runner[U]
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to Ensuring[This.Runner[U]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to StringFormat[This.Runner[U]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
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
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
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
-
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
shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversalImpl.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[GraphTraversalImpl.Path]
- Attributes
- protected[scalax.collection]
-
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
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
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
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
topologicalSort(setup: TopoSortSetup, maybeHandle: Option[Handle] = None): GraphTraversalImpl.CycleNodeOrTopologicalOrder
- Attributes
- protected[scalax.collection]
-
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
-
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 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()
-
def
→[B](y: B): (This.Runner[U], B)
- Implicit
- This member is added by an implicit conversion from This.Runner[U] to ArrowAssoc[This.Runner[U]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
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
.