Package0.8AlgebraAlgorithmsData StructuresGraphs
algebraic-graphs
A library for algebraic graph construction and transformation
- Version0.8
- CategoryAlgebra, Algorithms, Data Structures, Graphs
- LicenceMIT
- AuthorAndrey Mokhov <andrey.mokhov@gmail.com>, github: @snowleopard
- MaintainerAndrey Mokhov <andrey.mokhov@gmail.com>, github: @snowleopard, Alexandre Moine <alexandre@moine.me>, github: @nobrakal
- Homepagegithub.com/snowleopard/alga
- Pinned byhackage algebraic-graphs 0.8
- Sourcehackage.haskell.org/package/algebraic-graphs-0.8
Modules
- Algebra.GraphAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Acyclic.AdjacencyMapAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.AdjacencyIntMapAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.AdjacencyIntMap.AlgorithmAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.AdjacencyMapAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.AdjacencyMap.AlgorithmAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Bipartite.AdjacencyMapAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Bipartite.AdjacencyMap.AlgorithmAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.ClassAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Example.Todo
- Algebra.Graph.ExportAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Export.DotAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.HigherKinded.ClassAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.LabelAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.LabelledAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Labelled.AdjacencyMapAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Labelled.Example.AutomatonAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Labelled.Example.NetworkAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.NonEmptyAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.NonEmpty.AdjacencyMapAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.RelationAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.Relation.PreorderAn abstract implementation of preorder relations. Use Algebra.Graph.Class
- Algebra.Graph.Relation.ReflexiveAn abstract implementation of reflexive binary relations. Use
- Algebra.Graph.Relation.SymmetricAn abstract implementation of symmetric binary relations. To avoid name
- Algebra.Graph.Relation.TransitiveAn abstract implementation of transitive binary relations. Use
- Algebra.Graph.ToGraphAlga is a library for algebraic construction and manipulation of graphs
- Algebra.Graph.UndirectedAlga is a library for algebraic construction and manipulation of graphs
- Data.Graph.TypedAlga is a library for algebraic construction and manipulation of graphs
Internal modules · 1
- Algebra.Graph.InternalAlga is a library for algebraic construction and manipulation of graphs
Description
Alga is 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 top-level module Algebra.Graph defines the main data type for algebraic graphs Graph, as well as associated algorithms. For type-safe representation and manipulation of non-empty algebraic graphs, see Algebra.Graph.NonEmpty. Furthermore, algebraic graphs with edge labels are implemented in Algebra.Graph.Labelled.
The library also provides conventional graph data structures, such as Algebra.Graph.AdjacencyMap along with its various flavours:
adjacency maps specialised to graphs with vertices of type Int (Algebra.Graph.AdjacencyIntMap), non-empty adjacency maps (Algebra.Graph.NonEmpty.AdjacencyMap), adjacency maps for undirected bipartite graphs (Algebra.Graph.Bipartite.AdjacencyMap), adjacency maps with edge labels (Algebra.Graph.Labelled.AdjacencyMap), acyclic adjacency maps (Algebra.Graph.Acyclic.AdjacencyMap),
A large part of the API of algebraic graphs and adjacency maps is available through the Foldable-like type class Algebra.Graph.ToGraph.
The type classes defined in Algebra.Graph.Class and Algebra.Graph.HigherKinded.Class can be used for polymorphic construction and manipulation of graphs.
This is an experimental library and the API is expected to remain unstable until version 1.0.0. Please consider contributing to the on-going discussions on the library API.
Depends on
5 packages- array-0.5.8.0with GHC
- base-4.23.0.0with GHC
- containers-0.8with GHC
- deepseq-1.5.2.0with GHC
- transformers-0.6.3.0with GHC