Type Members

1.  type AnySet[A] = Set[A]

   Attributes

   protected[scalax]

2.  type ExtSet[A] = Set[A] with ExtSetMethods[A]

   scala.collection.Set extended by some useful methods in the context of Graph.

3.  trait Graph[N, E[X] <: EdgeLikeIn[X]] extends AnySet[Param[N, E]] with GraphLike[N, E, Graph]

   The main trait for immutable graphs bundling the functionality of traits concerned with specific aspects.

   The main trait for immutable graphs bundling the functionality of traits concerned with specific aspects.

   N

   the type of the nodes (vertices) in this graph.

   E

   the kind of the edges in this graph.

4.  trait GraphBase[N, E[X] <: EdgeLikeIn[X]] extends Serializable

   Base template trait for graphs.

   Base template trait for graphs.

   This trait provides the common structure and base operations for immutable graphs independently of their representation. Base operations also cover one-step traversals. For unlimited traversals see trait GraphTraversal.

   Users of Graph usually don't interact directly with this trait but with trait Graph instead which inherits the functionality provided by this trait.

   If E inherits DirectedEdgeLike the graph is directed, otherwise it is undirected or mixed.

   N

   the user type of the nodes (vertices) in this graph.

   E

   the kind of the edges (links) in this graph.

5.  trait GraphDegree[N, E[X] <: EdgeLikeIn[X]] extends AnyRef

   A trait for graph degree calculations.

   A trait for graph degree calculations.

   N

   the user type of the nodes (vertices) in this graph.

   E

   the kind of the edges (links) in this graph.

6.  trait GraphLike[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with AnySet[Param[X, Y[X]]] with Graph[X, Y[X]]] extends SetLike[Param[N, E], This[N, E]] with GraphTraversal[N, E] with GraphBase[N, E] with GraphDegree[N, E]

   A template trait for graphs.

   A template trait for graphs.

   This trait provides the common structure and operations of immutable graphs independently of their representation.

   If E inherits DirectedEdgeLike the graph is directed, otherwise it is undirected or mixed.

   N

   the user type of the nodes (vertices) in this graph.

   E

   the higher kinded type of the edges (links) in this graph.

   This

   the higher kinded type of the graph itself.

7.  trait GraphTraversal[N, E[X] <: EdgeLikeIn[X]] extends GraphBase[N, E]

   Graph-related functionality such as traversals, path finding, cycle detection etc.

   Graph-related functionality such as traversals, path finding, cycle detection etc. All algorithms including breadth-first, depth-first, white-gray-black search and Dijkstra's algorithm are tail recursive.

   Before starting a traversal a Traverser such as scalax.collection.GraphTraversal#InnerNodeTraverser is instantiated explicitly or implicitly. It holds settings like maxDepth, subgraph or ordering providing a fine-grained control of the traversal. Traversers also extend scala.collection.Traversable meaning that you can process the visited nodes and edges in a functional way.

   See also

   http://www.scala-graph.org/guides/core-traversing

8.  trait GraphTraversalImpl[N, E[X] <: EdgeLikeIn[X]] extends GraphTraversal[N, E] with TraverserImpl[N, E] with State[N, E]

   Default implementation of the functionality defined by GraphTraversal except for algorithms that are placed in TraverserImpl.

9.  type MSet[A] = Set[A]

   Attributes

   protected[scalax]

10.  trait State[N, E[X] <: EdgeLikeIn[X]] extends AnyRef

    Adds bit fields to the graph and its nodes facilitating fast storage and retrieval of traversal-specific flags as a decoupled implementation trait.

    Adds bit fields to the graph and its nodes facilitating fast storage and retrieval of traversal-specific flags as a decoupled implementation trait. These flags are often used to keep track of visited nodes. Traversals (algorithms) acquire handles by calling withHandle. Then, in withHandle's code block, node.visited or node.bit is called with the supplied handle as an implicit parameter to set or get a node's flag.

    Attributes

    protected

11.  trait TraverserImpl[N, E[X] <: EdgeLikeIn[X]] extends AnyRef

    Default implementation of the graph algorithms to maintain the functionality defined by GraphTraversal.