Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
This is a Graph
without the phantom type variable. Very few
functions work with this type.
Instances
Functor (SomeGraph e) Source # | |
(Eq v, Eq e) => Eq (SomeGraph e v) Source # | |
(Ord v, Ord e) => Ord (SomeGraph e v) Source # | |
Defined in Data.Graph.Types.Internal compare :: SomeGraph e v -> SomeGraph e v -> Ordering # (<) :: SomeGraph e v -> SomeGraph e v -> Bool # (<=) :: SomeGraph e v -> SomeGraph e v -> Bool # (>) :: SomeGraph e v -> SomeGraph e v -> Bool # (>=) :: SomeGraph e v -> SomeGraph e v -> Bool # |
A reference to a vertex in a Graph
with matching type variable g
.
Vertex
is a thin wrapper for Int
and does not hold the label
of the vertex.
All vertices in a Graph
with matching type variable g
.
Mutable vertices that have the same length as the vertices in a Graph
.
This is used to safely implement algorithms that need to mark vertices
as they traverse a graph.
data MUVertices s g v Source #
This is more accurately thought of as a graph builder rather than a mutable graph. You can add vertices and edges, and you can delete edges, but you cannot delete vertices.