algebraic-graphs v0.3 Release Notes

Release Date: 2018-11-29 // over 5 years ago
  • 0.3

    • โœ… #129: Add a testsuite for rewrite rules based on the inspection-testing library.
    • #63, #148: Add relational composition of algebraic graphs.
    • #139, #146: Add relational operations to adjacency maps.
    • #146: Rename preorderClosure to closure.
    • #146: Switch to left-to-right composition in Relation.compose.
    • #143: Allow newer QuickCheck.
    • #140, #142: Fix Show instances.
    • #128, #130: Modify the SCC algorithm to return non-empty graph components.
    • ๐Ÿšš #130: Move adjacency map algorithms to separate modules.
    • #130: Export fromAdjacencySets and fromAdjacencyIntSets.
    • #138: Do not require Eq instance on the string type when exporting graphs.
    • #136: Rename Algebra.Graph.NonEmpty.NonEmptyGraph to Algebra.Graph.NonEmpty.Graph.
    • #136: Add Algebra.Graph.NonEmpty.AdjacencyMap.
    • ๐Ÿšš #136: Remove vertexIntSet from the API of basic graph data types. Also
      โœ‚ remove Algebra.Graph.adjacencyMap and Algebra.Graph.adjacencyIntMap.
      This functionality is still available from the type class ToGraph.
    • #126, #131: Implement custom Ord instance.
    • #17, #122, #125, #149: Add labelled algebraic graphs.
    • #121: Drop Foldable and Traversable instances.
    • #113: Add Labelled.AdjacencyMap.