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
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- Runner
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
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 CC.Runner[U] toany2stringadd[CC.Runner[U]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (CC.Runner[U], B)
- Implicit
- This member is added by an implicit conversion from CC.Runner[U] toArrowAssoc[CC.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[GraphTraversalImpl.Impl[A, CC]]
- Annotations
- @inline()
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def bfs(maybeHandle: Option[Handle] = None): Option[NodeT]
- Attributes
- protected[collection]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def dfs[U](maybeHandle: Option[Handle] = None): Option[NodeT]
- Attributes
- protected[collection]
- Annotations
- @inline()
- def dfsStack[U](nodeUpVisitor: (NodeT) => U = Visitor.empty, maybeHandle: Option[Handle] = None): (Option[NodeT], Stack[Element])
- returns
(node stopped at, stack of ...)
- Attributes
- protected[collection]
- def dfsTarjan(maybeHandle: Option[Handle] = None, nodeUpVisitor: (NodeT) => U = Visitor.empty): Iterable[GraphTraversalImpl.Component]
- Attributes
- protected[collection]
- def dfsWGB(globalState: Array[Handle] = Array.empty[Handle], mustContain: Option[NodeT] = None): Option[(NodeT, Stack[CycleStackElem])]
Tail-recursive white-gray-black DFS implementation for cycle detection.
Tail-recursive white-gray-black DFS implementation for cycle detection.
- Attributes
- protected[collection]
- def ensuring(cond: (CC.Runner[U]) => Boolean, msg: => Any): CC.Runner[U]
- Implicit
- This member is added by an implicit conversion from CC.Runner[U] toEnsuring[CC.Runner[U]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (CC.Runner[U]) => Boolean): CC.Runner[U]
- Implicit
- This member is added by an implicit conversion from CC.Runner[U] toEnsuring[CC.Runner[U]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): CC.Runner[U]
- Implicit
- This member is added by an implicit conversion from CC.Runner[U] toEnsuring[CC.Runner[U]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): CC.Runner[U]
- Implicit
- This member is added by an implicit conversion from CC.Runner[U] toEnsuring[CC.Runner[U]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversalImpl.EdgeT) => T)(implicit arg0: Numeric[T]): Option[GraphTraversalImpl.Path]
- Attributes
- protected[collection]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def topologicalSort(setup: TopoSortSetup, maybeHandle: Option[Handle] = None): GraphTraversalImpl.TopologicalSort
- Attributes
- protected[collection]
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from CC.Runner[U] toStringFormat[CC.Runner[U]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (CC.Runner[U], B)
- Implicit
- This member is added by an implicit conversion from CC.Runner[U] toArrowAssoc[CC.Runner[U]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraphimmutable.Graphand its inner nodesmutable.Graphand its inner nodes.edgespackage and its subpackageshyperedgespackage and its subpackages.labeled edgespackagemultilabeled edgespackagelabeled hyperedgespackagemultilabeled hyperedgespackageordered labeled hyperedgespackageordered multilabeled hyperedgesobjectgenericpackage.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.