Copyright | (c) Edward Z. Yang 2016 |
---|---|

License | BSD3 |

Maintainer | cabal-dev@haskell.org |

Stability | experimental |

Portability | portable |

Safe Haskell | None |

Language | Haskell2010 |

A data type representing directed graphs, backed by Data.Graph. It is strict in the node type.

This is an alternative interface to Data.Graph. In this interface,
nodes (identified by the `IsNode`

type class) are associated with a
key and record the keys of their neighbors. This interface is more
convenient than `Graph`

, which requires vertices to be
explicitly handled by integer indexes.

The current implementation has somewhat peculiar performance
characteristics. The asymptotics of all map-like operations mirror
their counterparts in Data.Map. However, to perform a graph
operation, we first must build the Data.Graph representation, an
operation that takes *O(V + E log V)*. However, this operation can
be amortized across all queries on that particular graph.

Some nodes may be broken, i.e., refer to neighbors which are not
stored in the graph. In our graph algorithms, we transparently
ignore such edges; however, you can easily query for the broken
vertices of a graph using `broken`

(and should, e.g., to ensure that
a closure of a graph is well-formed.) It's possible to take a closed
subset of a broken graph and get a well-formed graph.

- data Graph a
- class Ord (Key a) => IsNode a where
- null :: Graph a -> Bool
- size :: Graph a -> Int
- member :: IsNode a => Key a -> Graph a -> Bool
- lookup :: IsNode a => Key a -> Graph a -> Maybe a
- empty :: IsNode a => Graph a
- insert :: IsNode a => a -> Graph a -> Graph a
- deleteKey :: IsNode a => Key a -> Graph a -> Graph a
- deleteLookup :: IsNode a => Key a -> Graph a -> (Maybe a, Graph a)
- unionLeft :: IsNode a => Graph a -> Graph a -> Graph a
- unionRight :: IsNode a => Graph a -> Graph a -> Graph a
- stronglyConnComp :: Graph a -> [SCC a]
- data SCC vertex :: * -> *
- = AcyclicSCC vertex
- | CyclicSCC [vertex]

- cycles :: Graph a -> [[a]]
- broken :: Graph a -> [(a, [Key a])]
- neighbors :: Graph a -> Key a -> Maybe [a]
- revNeighbors :: Graph a -> Key a -> Maybe [a]
- closure :: Graph a -> [Key a] -> Maybe [a]
- revClosure :: Graph a -> [Key a] -> Maybe [a]
- topSort :: Graph a -> [a]
- revTopSort :: Graph a -> [a]
- toMap :: Graph a -> Map (Key a) a
- fromDistinctList :: (IsNode a, Show (Key a)) => [a] -> Graph a
- toList :: Graph a -> [a]
- keys :: Graph a -> [Key a]
- keysSet :: Graph a -> Set (Key a)
- toGraph :: Graph a -> (Graph, Vertex -> a, Key a -> Maybe Vertex)
- data Node k a = N a k [k]
- nodeValue :: Node k a -> a

# Graph type

A graph of nodes `a`

. The nodes are expected to have instance
of class `IsNode`

.

class Ord (Key a) => IsNode a where Source #

The `IsNode`

class is used for datatypes which represent directed
graph nodes. A node of type `a`

is associated with some unique key of
type

; given a node we can determine its key (`Key`

a`nodeKey`

)
and the keys of its neighbors (`nodeNeighbors`

).

# Query

lookup :: IsNode a => Key a -> Graph a -> Maybe a Source #

*O(log V)*. Lookup the node at a key in the graph.

# Construction

deleteKey :: IsNode a => Key a -> Graph a -> Graph a Source #

*O(log V)*. Delete the node at a key from the graph.

deleteLookup :: IsNode a => Key a -> Graph a -> (Maybe a, Graph a) Source #

*O(log V)*. Lookup and delete. This function returns the deleted
value if it existed.

# Combine

unionLeft :: IsNode a => Graph a -> Graph a -> Graph a Source #

*O(V + V')*. Left-biased union, preferring entries from
the first map when conflicts occur.

# Graph algorithms

stronglyConnComp :: Graph a -> [SCC a] Source #

*Ω(V + E)*. Compute the strongly connected components of a graph.
Requires amortized construction of graph.

data SCC vertex :: * -> * Source #

Strongly connected component.

AcyclicSCC vertex | A single vertex that is not in any cycle. |

CyclicSCC [vertex] | A maximal set of mutually reachable vertices. |

cycles :: Graph a -> [[a]] Source #

*Ω(V + E)*. Compute the cycles of a graph.
Requires amortized construction of graph.

broken :: Graph a -> [(a, [Key a])] Source #

*O(1)*. Return a list of nodes paired with their broken
neighbors (i.e., neighbor keys which are not in the graph).
Requires amortized construction of graph.

neighbors :: Graph a -> Key a -> Maybe [a] Source #

Lookup the immediate neighbors from a key in the graph. Requires amortized construction of graph.

revNeighbors :: Graph a -> Key a -> Maybe [a] Source #

Lookup the immediate reverse neighbors from a key in the graph. Requires amortized construction of graph.

closure :: Graph a -> [Key a] -> Maybe [a] Source #

Compute the subgraph which is the closure of some set of keys.
Returns `Nothing`

if one (or more) keys are not present in
the graph.
Requires amortized construction of graph.

revClosure :: Graph a -> [Key a] -> Maybe [a] Source #

Compute the reverse closure of a graph from some set
of keys. Returns `Nothing`

if one (or more) keys are not present in
the graph.
Requires amortized construction of graph.

topSort :: Graph a -> [a] Source #

Topologically sort the nodes of a graph. Requires amortized construction of graph.

revTopSort :: Graph a -> [a] Source #

Reverse topologically sort the nodes of a graph. Requires amortized construction of graph.

# Conversions

## Maps

## Lists

fromDistinctList :: (IsNode a, Show (Key a)) => [a] -> Graph a Source #

*O(V log V)*. Convert a list of nodes (with distinct keys) into a graph.

## Sets

## Graphs

toGraph :: Graph a -> (Graph, Vertex -> a, Key a -> Maybe Vertex) Source #

*O(1)*. Convert a graph into a `Graph`

.
Requires amortized construction of graph.