Alga is a library for algebraic construction and manipulation of graphs in Haskell. See this Haskell Symposium paper and the corresponding talk for the motivation behind the library, the underlying theory and implementation details. We can give semantics to the constructors in terms of the pair (V, E) of graph vertices and edges. Alga can handle graphs comprising millions of vertices and billions of edges in a matter of seconds, which is fast enough for many applications. We believe there is a lot of potential for improving the performance of the library, and this is one of our top priorities. If you come across a performance issue when using the library, please let us know.
Features
- Algebraic graphs implemented in a few other languages, including Agda, F#, Scala and TypeScript
- Alga can handle graphs comprising millions of vertices and billions of edges in a matter of seconds
- Every expression represents a graph, and every graph can be represented by an expression
- Alga is a library for algebraic construction and manipulation of graphs in Haskell
- There is also a Haskell eXchange talk, and a tutorial
- Give an algebraic semantics to graph construction primitives
License
MIT LicenseFollow Algebraic graphs
Other Useful Business Software
Build AI Apps with Gemini 3 on Vertex AI
Vertex AI gives developers access to Gemini 3—Google’s most advanced reasoning and coding model—plus 200+ foundation models including Claude, Llama, and Gemma. Build generative AI apps with Vertex AI Studio, customize with fine-tuning, and deploy to production with enterprise-grade MLOps. New customers get $300 in free credits.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Algebraic graphs!