Safe Haskell | Safe-Infered |
---|

A module for working with directed graphs (digraphs). Some of the functions are specifically for working with directed acyclic graphs (DAGs), that is, directed graphs containing no cycles.

- toSet :: Ord a => [a] -> [a]
- data Digraph v = DG [v] [(v, v)]
- nf :: Ord v => Digraph v -> Digraph v
- vertices :: Digraph t -> [t]
- edges :: Digraph t -> [(t, t)]
- predecessors :: Eq t => Digraph t -> t -> [t]
- successors :: Eq t => Digraph t -> t -> [t]
- adjLists :: Ord a => Digraph a -> (Map a [a], Map a [a])
- digraphIsos1 :: (Eq a1, Eq a) => Digraph a -> Digraph a1 -> [[(a, a1)]]
- digraphIsos2 :: (Ord k, Ord k1) => Digraph k -> Digraph k1 -> [[(k, k1)]]
- heightPartitionDAG :: Ord k => Digraph k -> [[k]]
- isDAG :: Ord a => Digraph a -> Bool
- dagIsos :: (Ord a, Ord a1) => Digraph a -> Digraph a1 -> [[(a, a1)]]
- isDagIso :: (Ord a, Ord b) => Digraph a -> Digraph b -> Bool
- perms :: [a] -> [[a]]
- isoRepDAG1 :: Ord k => Digraph k -> Digraph Int
- isoRepDAG2 :: (Enum t1, Num t1, Ord t1, Ord t) => Digraph t -> [(t, t1)]
- isoRepDAG3 :: Ord a => Digraph a -> Digraph Int
- isoRepDAG :: Ord a => Digraph a -> Digraph Int

# Documentation

A digraph is represented as DG vs es, where vs is the list of vertices, and es is the list of edges. Edges are directed: an edge (u,v) means an edge from u to v. A digraph is considered to be in normal form if both es and vs are in ascending order. This is the preferred form, and some functions will only work for digraphs in normal form.

DG [v] [(v, v)] |

predecessors :: Eq t => Digraph t -> t -> [t]Source

successors :: Eq t => Digraph t -> t -> [t]Source

heightPartitionDAG :: Ord k => Digraph k -> [[k]]Source

isoRepDAG :: Ord a => Digraph a -> Digraph IntSource

Given a directed acyclic graph (DAG), return a canonical representative for its isomorphism class.
`isoRepDAG dag`

is isomorphic to `dag`

. It follows that if `isoRepDAG dagA == isoRepDAG dagB`

then `dagA`

is isomorphic to `dagB`

.
Conversely, `isoRepDAG dag`

is the minimal element in the isomorphism class, subject to some constraints.
It follows that if `dagA`

is isomorphic to `dagB`

, then `isoRepDAG dagA == isoRepDAG dagB`

.

The algorithm of course is faster on some DAGs than others: roughly speaking, it prefers "tall" DAGs (long chains) to "wide" DAGs (long antichains), and it prefers asymmetric DAGs (ie those with smaller automorphism groups).