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
$300 Free Credits for Your Google Cloud Projects
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Algebraic graphs!