package algorithm
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- algorithm
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- final case class Backtrack[S](state: S) extends TraversalEvent[S] with Product with Serializable
- class BreadthFirstTraversal[E, N] extends StepTraversal[E, N]
- final case class Completed[S](state: S, backtrack: Option[S] = None) extends TraversalEvent[S] with Product with Serializable
- class DepthFirstTraversal[E, N] extends StepTraversal[E, N]
- class DijkstraShortestPath[M, E, N] extends AnyRef
- implicit class GraphOps[M, E, N] extends AnyRef
- final case class Path[E, N](steps: List[Step[E, N]]) extends Product with Serializable
- final case class Skipped[S](state: S) extends TraversalEvent[S] with Product with Serializable
- trait StepTraversal[E, N] extends Traversal[TraversalEvent[Step[E, N]]]
- class TopologicalSort[E, N] extends AnyRef
- trait Traversal[E] extends AnyRef
- sealed trait TraversalEvent[T] extends AnyRef
- trait TraversalState[S, Id] extends AnyRef
- final case class Visited[S](state: S) extends TraversalEvent[S] with Product with Serializable
Value Members
- object Traversal
- object TraversalState