« Changelog History


algebraic-graphs v0.2 Release Notes

    • #117: Add sparsify.
    • #115: Add isDfsForestOf.
    • #114: Add a basic implementation of edge-labelled graphs.
    • #107: Drop starTranspose.
    • #106: Extend ToGraph with algorithms based on adjacency maps.
    • #106: Add isAcyclic and reachable.
    • #106: Rename isTopSort to isTopSortOf.
    • 👷 #102: Switch the master branch to GHC 8.4.3. Add a CI instance for GHC 8.6.1.
    • #101: Drop -O2 from the ghc-options section of the Cabal file.
    • #100: Rename fromAdjacencyList to stars.
    • #79: Improve the API consistency: rename IntAdjacencyMap to AdjacencyIntMap, and then rename the function that extracts its adjacency map to adjacencyIntMap to avoid the clash with AdjacencyMap.adjacencyMap, which has incompatible type.
    • 🐎 #82, #92: Add performance regression suite.
    • 🚚 #76: Remove benchmarks.
    • #74: Drop dependency of Algebra.Graph on graph type classes.
    • 🚚 #62: Move King-Launchbury graphs into Data.Graph.Typed.
    • 🐎 #67, #68, #69, #77, #81, #93, #94, #97, #103, #110: Various performance improvements.
    • #66, #72, #96, #98: Add missing NFData instances.