Packages

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
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Runner
  2. AnyRef
  3. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by EdgeAssoc
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Runner(stopAt: GraphTraversalImpl.NodeFilter, visitor: (A) ⇒ U)

    stopAt

    node predicate marking an end condition for the search

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. 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
  4. 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()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def apply(): Option[NodeT]
    Attributes
    protected[scalax.collection.TraverserImpl.Impl]
    Annotations
    @inline()
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def bfs(maybeHandle: Option[Handle] = None): Option[NodeT]
    Attributes
    protected[scalax.collection]
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def dfs[U](maybeHandle: Option[Handle] = None): Option[NodeT]
    Attributes
    protected[scalax.collection]
    Annotations
    @inline()
  11. def dfsStack[U](nodeUpVisitor: (NodeT) ⇒ U = empty, maybeHandle: Option[Handle] = None): (Option[NodeT], ArrayStack[Element[NodeT]])

    returns

    (node stopped at, stack of ...)

    Attributes
    protected[scalax.collection]
  12. def dfsTarjan(maybeHandle: Option[Handle] = None, nodeUpVisitor: (NodeT) ⇒ U = empty): Iterable[GraphTraversalImpl.Component]
    Attributes
    protected[scalax.collection]
  13. def dfsWGB(globalState: Array[Handle] = Array.empty[Handle]): (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]
  14. 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
  15. 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
  16. 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
  17. 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
  18. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  20. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. 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()
  22. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  23. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  24. 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
  25. 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
  26. 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
    InParamParam
  27. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  28. 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
  29. 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
    InParamParam
  30. def maxDepth: Int
  31. 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
  32. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  33. final def notify(): Unit
    Definition Classes
    AnyRef
  34. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  35. def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversalImpl.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[GraphTraversalImpl.Path]
    Attributes
    protected[scalax.collection]
  36. 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
  37. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  38. 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
  39. def toString(): String
    Definition Classes
    AnyRef → Any
  40. def topologicalSort(setup: TopoSortSetup, maybeHandle: Option[Handle] = None): GraphTraversalImpl.CycleNodeOrTopologicalOrder
    Attributes
    protected[scalax.collection]
  41. 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
    OuterNodeNodeParam
  42. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  44. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. 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()
  46. 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()
  47. 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

  1. 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

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from This.Runner[U] to OuterNode[This.Runner[U]]

Inherited by implicit conversion CollectionsHaveToParArray from This.Runner[U] to CollectionsHaveToParArray[This.Runner[U], T]

Inherited by implicit conversion EdgeAssoc from This.Runner[U] to EdgeAssoc[This.Runner[U]]

Inherited by implicit conversion any2stringadd from This.Runner[U] to any2stringadd[This.Runner[U]]

Inherited by implicit conversion StringFormat from This.Runner[U] to StringFormat[This.Runner[U]]

Inherited by implicit conversion Ensuring from This.Runner[U] to Ensuring[This.Runner[U]]

Inherited by implicit conversion ArrowAssoc from This.Runner[U] to ArrowAssoc[This.Runner[U]]

Ungrouped