Changelog History
Page 2
-
v5.5.2.1 Changes
July 25, 2015- Only create
NFData
instances for GHC >= 7.4.1.
- Only create
-
v5.5.2.0 Changes
July 22, 2015๐ Documentation, clean-up and refactoring of various parts of the library.
- As part of this, various types now have instances for classes
like
Show
,Eq
,Ord
,NFData
, etc. where applicable. - In particular, the various options for use with depth-first search and shortest path queries was documented by David Luposchainsky.
- As part of this, various types now have instances for classes
like
โ Addition of a proper test-suite. So far it covers the
Data.Graph.Inductive.Graph
module and allData.Graph.Inductive.Query.*
modules except forMonad
.- The tests are also automatically run for every (set of) commits thanks to Travis-CI.
Arbitrary instances for the two graph types are now available in the new
fgl-arbitrary
sub-package.Now depends solely on the
transformers
library rather thanmtl
.Potentially breaking changes:
These changes are those where the behaviour was un-specified or didn't match the documentation.
nodeRange
andnodeRangeM
for the various graph data structures erroneously returned(0,0)
for empty graphs (making them indistinguishable from graphs containing the single node0
). They now match the default implementation of throwing an error.- The behaviour of
delLEdge
when dealing with multiple edges was unspecified; it now deletes only a single edge and the new functiondelAllLEdge
deletes all edges matching the one provided.
โ Additional functions thanks to Sergiu Ivanov:
- Creating sub-graphs by
Node
- andContext
-filtering as well as induced by a set ofNode
s. - Graph condensation (i.e. graph of strongly-connected-components).
- Various edge- and neighbor-based helper functions.
- Creating sub-graphs by
The graph types now have
Generic
instances thanks to Piotr Mlodawski.The
OrdGr
wrapper by Trevor Cook allows performingOrd
-based comparisons on graphs.
-
v5.5.1.0 Changes
๐ Support added for GHC 7.10 by Herbert Valerio Riedel.
โ Additional DFS query functions added by Conrad Parker.
Repository location changed to GitHub.
Code cleanup:
- Replaced usage of internal FiniteMap copy with Data.Map and Data.Set from the containers library.
- Remove usage of data type contexts.
- Use newtypes where applicable.
-
v5.5.0.1 Changes
- ๐ Fix up Eq instances for Tree and PatriciaTree so that they work with multiple edges.
-
v5.5.0.0 Changes
โ Add proper Show, Read and Eq instances to Data.Graph.Inductive.Tree and Data.Graph.Inductive.PatriciaTree.
โ Add pretty-printing functions to Data.Graph.Inductive.Graph. These are based upon the old Show implementation for Data.Graph.Inductive.Tree.
0๏ธโฃ Now use PatriciaTree by default rather than Tree (and recommend as such). IntMap has been receiving a lot of optimisation work on it, whereas the internal FiniteMap implementation hasn't received any attention.
The
version :: IO ()
action now uses the actual Cabal version.โ Remove Data.Graph.Inductive.Graphviz; use the graphviz package instead.
-
v5.4.2 Changes
May 01, 2008โ added Setup.hs to tar file
reimplementation of Data.Graph.Inductive.Query.Dominators by Bertram Felgenhauer:
It was buggy and very slow for large graphs. See http://www.haskell.org/pipermail/haskell-cafe/2008-April/041739.html
This patch also adds a new function, iDom, that returns the immediate dominators of the graph nodes.
Exported xdf*With functions from DFS.hs
many little cleanups thanks to many people (use 'darcs changes' to see the details)
-
v5.4.2.4 Changes
- โก๏ธ Update to work with GHC-7.2 and Cabal-1.6.
-
v5.4.2.3 Changes
Maintainership taken over by Ivan Miljenovic.
๐ Allow Data.Graph.Inductive.PatriciaTree to deal with multiple edges between nodes.
-
v5.4.2.2 Changes
November 01, 2008- ๐ Bugfix in Graphviz.sq
-
v5.4.2.1 Changes
June 01, 2008๐ bug fix in bcc by Reid Barton
โ added new dynamic graph implementation: Data.Graph.Inductive.PatriciaTree (thanks to Pho)
โ added test/benchmark.hs: a benchmark to compare Tree and PatriciaTree implementations (thanks to Pho)