algebraic-graphs
A library for algebraic graph construction and transformation
https://github.com/snowleopard/alga
| Version on this page: | 0.0.3 |
| LTS Haskell 22.17: | 0.7@rev:2 |
| Stackage Nightly 2024-04-19: | 0.7@rev:2 |
| Latest on Hackage: | 0.7@rev:2 |
This version can be pinned in stack with:
algebraic-graphs-0.0.3@sha256:9671c58c47eeba635a511e172fbf6104c92cab1b876e1f4563158583a3fcabc5,5439Module documentation for 0.0.3
- Algebra
- Algebra.Graph
- Algebra.Graph.AdjacencyMap
- Algebra.Graph.Class
- Algebra.Graph.Fold
- Algebra.Graph.HigherKinded
- Algebra.Graph.IntAdjacencyMap
- Algebra.Graph.Relation
- Algebra.Graph
Depends on 3 packages(full list with versions):
Algebraic graphs
A library for algebraic construction and manipulation of graphs in Haskell. See this paper for the motivation behind the library, the underlying theory and implementation details.
The following series of blog posts also describe the ideas behind the library:
- Introduction: https://blogs.ncl.ac.uk/andreymokhov/an-algebra-of-graphs/
- A few different flavours of the algebra: https://blogs.ncl.ac.uk/andreymokhov/graphs-a-la-carte/
- Graphs in disguise or How to plan you holiday using Haskell: https://blogs.ncl.ac.uk/andreymokhov/graphs-in-disguise/
- Old graphs from new types: https://blogs.ncl.ac.uk/andreymokhov/old-graphs-from-new-types/
Some preliminary benchmarks can be found in doc/benchmarks.