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
toclosure
. - #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
andfromAdjacencyIntSets
. - #138: Do not require
Eq
instance on the string type when exporting graphs. - #136: Rename
Algebra.Graph.NonEmpty.NonEmptyGraph
toAlgebra.Graph.NonEmpty.Graph
. - #136: Add
Algebra.Graph.NonEmpty.AdjacencyMap
. - ๐ #136: Remove
vertexIntSet
from the API of basic graph data types. Also
โ removeAlgebra.Graph.adjacencyMap
andAlgebra.Graph.adjacencyIntMap
.
This functionality is still available from the type classToGraph
. - #126, #131: Implement custom
Ord
instance. - #17, #122, #125, #149: Add labelled algebraic graphs.
- #121: Drop
Foldable
andTraversable
instances. - #113: Add
Labelled.AdjacencyMap
.
- โ
#129: Add a testsuite for rewrite rules based on the