mutable

Type Members

1. trait AdjacencyListGraph[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: AdjacencyListGraph[X, Y[X], This] with Graph[X, Y[X]]] extends GraphLike[N, E, This] with mutable.AdjacencyListGraph[N, E, This]

   Implements an adjacency list based graph representation.

2. abstract class CompanionAlias[E[X] <: EdgeLikeIn[X]] extends GraphConstrainedCompanionAlias[Graph, E]

   Enables to quickly assemble mutable constrained graph companion modules.

3. type DAG[N] = Graph[N, DiEdge]

   Mutable directed acyclic Graph.

4. abstract class DefaultGraphImpl[N, E[X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]

5. type Forest[N] = Graph[N, UnDiEdge]

   Mutable undirected acyclic Graph.

6. trait Graph[N, E[X] <: EdgeLikeIn[X]] extends mutable.Graph[N, E] with constrained.Graph[N, E] with GraphLike[N, E, Graph]

7. class GraphBuilder[N, E[X] <: EdgeLikeIn[X], GC[N, E[X] <: EdgeLikeIn[X]] <: constrained.Graph[N, E[X]] with constrained.GraphLike[N, E[X], GC]] extends BuilderImpl[N, E, GC]

8. trait GraphLike[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends mutable.GraphLike[N, E, This] with constrained.GraphLike[N, E, This] with Growable[GraphParam[N, E]] with Shrinkable[GraphParam[N, E]] with Cloneable[Graph[N, E]] with Mutable

9. type Tree[N] = Graph[N, UnDiEdge]

   Mutable undirected connected acyclic Graph.

10. class UserConstrainedGraphImpl[N, E[X] <: EdgeLikeIn[X]] extends DefaultGraphImpl[N, E] with UserConstrainedGraph[N, E]