Data.Graph.Types

Documentation

data SomeGraph e v

This is a Graph without the phantom type variable. Very few functions work with this type.

Instances

Functor (SomeGraph e)

Methods

fmap :: (a -> b) -> SomeGraph e a -> SomeGraph e b

(<$) :: a -> SomeGraph e b -> SomeGraph e a

(Eq e, Eq v) => Eq (SomeGraph e v)

Methods

(==) :: SomeGraph e v -> SomeGraph e v -> Bool

(/=) :: SomeGraph e v -> SomeGraph e v -> Bool

(Ord e, Ord v) => Ord (SomeGraph e v)

Methods

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

max :: SomeGraph e v -> SomeGraph e v -> SomeGraph e v

min :: SomeGraph e v -> SomeGraph e v -> SomeGraph e v

data Graph g e v

A Graph with edges labeled by e and vertices labeled by v. The g type variable is a phatom type that associates a Graph with vertices that belong to it.

Instances

Functor (Graph g e)

Methods

fmap :: (a -> b) -> Graph g e a -> Graph g e b

(<$) :: a -> Graph g e b -> Graph g e a

data Vertex g

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.

Instances

Eq (Vertex g)

Methods

(==) :: Vertex g -> Vertex g -> Bool

(/=) :: Vertex g -> Vertex g -> Bool

Ord (Vertex g)

Methods

compare :: Vertex g -> Vertex g -> Ordering

(<) :: Vertex g -> Vertex g -> Bool

(<=) :: Vertex g -> Vertex g -> Bool

(>) :: Vertex g -> Vertex g -> Bool

(>=) :: Vertex g -> Vertex g -> Bool

max :: Vertex g -> Vertex g -> Vertex g

min :: Vertex g -> Vertex g -> Vertex g

Hashable (Vertex g)

Methods

hashWithSalt :: Int -> Vertex g -> Int

hash :: Vertex g -> Int

data Size g

data Vertices g v

All vertices in a Graph with matching type variable g.

Instances

Functor (Vertices g)

Methods

fmap :: (a -> b) -> Vertices g a -> Vertices g b

(<$) :: a -> Vertices g b -> Vertices g a

data MVertices s g v

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

Mutable unboxed vertices that have the same length as the vertices in a Graph. See MVertices.

data MGraph s g e v

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.

type IOGraph = MGraph RealWorld

type STGraph s = MGraph s