object GraphTraversal extends Serializable
Contains traversal parameter definitions such as direction constants.
- Alphabetic
- By Inheritance
- GraphTraversal
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- sealed trait Direction extends AnyRef
Algebraic type to determine which connected nodes the traversal has to follow.
Algebraic type to determine which connected nodes the traversal has to follow. The default value is
Successors.Note that methods returning a Cycle or Path accept only
Successors. - trait Kind extends AnyRef
Algebraic type for the kind of traversal.
- trait NodeInformer extends AnyRef
Marker trait for informers aimed at passing algorithmic-specific state to scalax.collection.GraphTraversal.ExtendedNodeVisitor.
Marker trait for informers aimed at passing algorithmic-specific state to scalax.collection.GraphTraversal.ExtendedNodeVisitor. Following informers are available:
- case class Parameters(kind: Kind = BreadthFirst, direction: Direction = Successors, maxDepth: Int = 0) extends Product with Serializable
Parameters to control traversals.
Parameters to control traversals.
- kind
The kind of traversal including breadth-first and depth-fist search.
- direction
Determines which connected nodes the traversal has to follow. The default value is
Successors.- maxDepth
A positive value to limit the number of layers for BFS respectively the number of consecutive child visits before siblings are visited for DFS.
0- the default - indicates that the traversal should have an unlimited depth.
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- 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()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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])
- case object AnyConnected extends Direction with Product with Serializable
Defines the traversal to follow successor and predecessor nodes alike.
- case object BreadthFirst extends Kind with Product with Serializable
Instructs the traverser to use a breadth first search (BSF, search layer-for-layer).
- case object DepthFirst extends Kind with Product with Serializable
Instructs the traverser to use a depth first search (DFS).
- object NodeInformer extends Serializable
- object Parameters extends Serializable
- case object Predecessors extends Direction with Product with Serializable
Defines the traversal to follow predecessor nodes.
- case object Successors extends Direction with Product with Serializable
Defines the traversal to follow successor nodes.
- object Visitor
Implements an empty visitor based on a value.
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.