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
Enterprise-grade ITSM, for every business
Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Algebraic graphs!