Object/Trait

scalax.collection

GraphTraversal

Related Docs: trait GraphTraversal | package collection

Permalink

object GraphTraversal extends Serializable

Contains traversal parameter definitions such as direction constants.

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Content Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphTraversal
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. sealed trait Direction extends AnyRef

    Permalink

    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.

  2. trait Kind extends AnyRef

    Permalink

    Algebraic type for the kind of traversal.

  3. trait NodeInformer extends AnyRef

    Permalink

    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. Before calling an informer please match against one of

    1. scalax.collection.GraphTraversalImpl.BfsInformer
    2. scalax.collection.GraphTraversalImpl.DfsInformer
    3. scalax.collection.GraphTraversalImpl.WgbInformer
    4. scalax.collection.GraphTraversalImpl.DijkstraInformer or any other implementation that is currently not known.
  4. case class Parameters(kind: Kind = BreadthFirst, direction: Direction = Successors, maxDepth: Int = 0) extends Product with Serializable

    Permalink

    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

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. object AnyConnected extends Direction

    Permalink

    Defines the traversal to follow successor and predecessor nodes alike.

  5. object BreadthFirst extends Kind with Product with Serializable

    Permalink

    Instructs the traverser to use a breadth first search (BSF, search layer-for-layer).

  6. object DepthFirst extends Kind with Product with Serializable

    Permalink

    Instructs the traverser to use a depth first search (DFS).

  7. object NodeInformer extends Serializable

    Permalink
  8. object Parameters extends Serializable

    Permalink
  9. object Predecessors extends Direction

    Permalink

    Defines the traversal to follow predecessor nodes.

  10. object Successors extends Direction

    Permalink

    Defines the traversal to follow successor nodes.

  11. object Visitor

    Permalink

    Implements an empty visitor based on a value.

  12. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  13. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  19. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped