cabal-version: 2.2 name: algebraic-graphs version: 0.7 x-revision: 3 synopsis: A library for algebraic graph construction and transformation license: MIT license-file: LICENSE author: Andrey Mokhov , github: @snowleopard maintainer: Andrey Mokhov , github: @snowleopard, Alexandre Moine , github: @nobrakal copyright: Andrey Mokhov, 2016-2022 homepage: https://github.com/snowleopard/alga bug-reports: https://github.com/snowleopard/alga/issues category: Algebra, Algorithms, Data Structures, Graphs build-type: Simple tested-with: GHC==9.2, GHC==9.0, GHC==8.10, GHC==8.8, GHC==8.6, GHC==8.4 description: is a library for algebraic construction and manipulation of graphs in Haskell. See for the motivation behind the library, the underlying theory and implementation details. . The top-level module defines the main data type for /algebraic graphs/ , as well as associated algorithms. For type-safe representation and manipulation of /non-empty algebraic graphs/, see . Furthermore, /algebraic graphs with edge labels/ are implemented in . . The library also provides conventional graph data structures, such as along with its various flavours: . * adjacency maps specialised to graphs with vertices of type 'Int' (), * non-empty adjacency maps (), * adjacency maps for undirected bipartite graphs (), * adjacency maps with edge labels (), * acyclic adjacency maps (), . A large part of the API of algebraic graphs and adjacency maps is available through the 'Foldable'-like type class . . The type classes defined in and 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 . extra-doc-files: AUTHORS.md CHANGES.md README.md source-repository head type: git location: https://github.com/snowleopard/alga.git common common-settings build-depends: array >= 0.4 && < 0.6, base >= 4.11 && < 5, containers >= 0.5.5.1 && < 0.8, deepseq >= 1.3.0.1 && < 1.6, transformers >= 0.4 && < 0.7 default-language: Haskell2010 default-extensions: ConstraintKinds DeriveFunctor DeriveGeneric FlexibleContexts FlexibleInstances GADTs GeneralizedNewtypeDeriving MultiParamTypeClasses RankNTypes ScopedTypeVariables TupleSections TypeApplications TypeFamilies other-extensions: CPP OverloadedStrings RecordWildCards ViewPatterns ghc-options: -Wall -Wcompat -Wincomplete-record-updates -Wincomplete-uni-patterns -Wredundant-constraints -fno-warn-name-shadowing -fno-warn-unused-imports -fspec-constr library import: common-settings hs-source-dirs: src exposed-modules: Algebra.Graph, Algebra.Graph.Undirected, Algebra.Graph.Acyclic.AdjacencyMap, Algebra.Graph.AdjacencyIntMap, Algebra.Graph.AdjacencyIntMap.Algorithm, Algebra.Graph.AdjacencyMap, Algebra.Graph.AdjacencyMap.Algorithm, Algebra.Graph.Bipartite.AdjacencyMap, Algebra.Graph.Bipartite.AdjacencyMap.Algorithm, Algebra.Graph.Class, Algebra.Graph.Example.Todo, Algebra.Graph.Export, Algebra.Graph.Export.Dot, Algebra.Graph.HigherKinded.Class, Algebra.Graph.Internal, Algebra.Graph.Label, Algebra.Graph.Labelled, Algebra.Graph.Labelled.AdjacencyMap, Algebra.Graph.Labelled.Example.Automaton, Algebra.Graph.Labelled.Example.Network, Algebra.Graph.NonEmpty, Algebra.Graph.NonEmpty.AdjacencyMap, Algebra.Graph.Relation, Algebra.Graph.Relation.Preorder, Algebra.Graph.Relation.Reflexive, Algebra.Graph.Relation.Symmetric, Algebra.Graph.Relation.Transitive, Algebra.Graph.ToGraph, Data.Graph.Typed test-suite main import: common-settings hs-source-dirs: test type: exitcode-stdio-1.0 main-is: Main.hs other-modules: Algebra.Graph.Test, Algebra.Graph.Test.API, Algebra.Graph.Test.Acyclic.AdjacencyMap, Algebra.Graph.Test.AdjacencyIntMap, Algebra.Graph.Test.AdjacencyMap, Algebra.Graph.Test.Arbitrary, Algebra.Graph.Test.Bipartite.AdjacencyMap, Algebra.Graph.Test.Example.Todo Algebra.Graph.Test.Export, Algebra.Graph.Test.Generic, Algebra.Graph.Test.Graph, Algebra.Graph.Test.Undirected, Algebra.Graph.Test.Internal, Algebra.Graph.Test.Label, Algebra.Graph.Test.Labelled.AdjacencyMap, Algebra.Graph.Test.Labelled.Graph, Algebra.Graph.Test.NonEmpty.AdjacencyMap, Algebra.Graph.Test.NonEmpty.Graph, Algebra.Graph.Test.Relation, Algebra.Graph.Test.Relation.Symmetric, Algebra.Graph.Test.RewriteRules, Data.Graph.Test.Typed build-depends: algebraic-graphs, extra >= 1.4 && < 2, inspection-testing >= 0.4.2.2 && < 0.6, QuickCheck >= 2.14 && < 2.16 other-extensions: ConstrainedClassMethods TemplateHaskell