An exception that is raised when an assumed DAG has a cycle
Represents common behavior of all directed graphs
Mixing this trait into a DiGraph indicates that each edge may be associated with an optional data value.
Mixing this trait into a DiGraph indicates that each edge may be associated with an optional data value. The EdgeData trait provides a minimal API for viewing edge data without mutation.
the vertex type (datatype) of the underlying DiGraph
the type of each edge data value
An exception that indicates that an edge cannot be found in a graph with edge data.
An exception that indicates that an edge cannot be found in a graph with edge data.
the vertex type is not captured as a type parameter, as it would be erased.
A class that represents an Euler Tour of a directed graph from a given root.
A class that represents an Euler Tour of a directed graph from a
given root. This requires O(n)
preprocessing time to generate
the initial Euler Tour.
Mixing this trait into a DiGraph indicates that each edge may be associated with an optional data value.
Mixing this trait into a DiGraph indicates that each edge may be associated with an optional data value. The MutableEdgeData trait provides an API for viewing and mutating edge data.
the vertex type (datatype) of the underlying DiGraph
the type of each edge data value
An exception that is raised when attempting to find an unreachable node
Implement a really simple graphviz dot renderer for a digraph There are three main renderers currently -
Implement a really simple graphviz dot renderer for a digraph There are three main renderers currently -
The type of the Node.