Portability | type families |
---|---|

Stability | experimental |

Maintainer | Edward Kmett <ekmett@gmail.com> |

Safe Haskell | Safe-Infered |

# Documentation

class (Monad g, Eq (Vertex g), Eq (Edge g)) => Graph g whereSource

Graph Identity | The empty graph |

Graph g => Graph (MaybeT g) | |

Graph g => Graph (IdentityT g) | |

Graph g => Graph (Dual g) | |

Ord i => Graph (AdjacencyList i) | |

(Graph g, Monoid m) => Graph (WriterT m g) | |

(Graph g, Monoid m) => Graph (WriterT m g) | |

Graph g => Graph (StateT s g) | |

Graph g => Graph (StateT s g) | |

Graph g => Graph (ReaderT m g) | |

(Graph g, Error e) => Graph (ErrorT e g) | |

Ord i => Graph (AdjacencyMatrix arr i) | |

(Graph g, Monoid w) => Graph (RWST r w s g) | |

(Graph g, Monoid w) => Graph (RWST r w s g) |

type VertexMap g = PropertyMap g (Vertex g)Source

type EdgeMap g = PropertyMap g (Edge g)Source

liftVertexMap :: (MonadTrans t, Graph (t g), Graph g, Vertex (t g) ~ Vertex g) => a -> t g (VertexMap (t g) a)Source

liftEdgeMap :: (MonadTrans t, Graph (t g), Graph g, Edge (t g) ~ Edge g) => a -> t g (EdgeMap (t g) a)Source