intmap-graph 1.2.0.0 → 1.3.0.0

raw patch · 2 files changed

+2/−2 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• intmap-graph.cabal +1/−1
• src/Graph/IntMap.hs +1/−1

@@ -1,5 +1,5 @@ name:                intmap-graph-version:             1.2.0.0+version:             1.3.0.0 Synopsis:            A graph library that allows to explore edges after their type Description:         It is easiest to explain this library with an example: A node has 300 outgoing edges, 100 red, 100 green, 100 blue. If you want to explore all green edges, most of the other graph libraries force you to look up all 300 edges and then filter after the property green. This means 300 O(log n) calls. With this library there is only one (log n) call necessary that gives a list of all green edges. homepage:            https://github.com/tkvogt/intmap-graph#readme

@@ -17,7 +17,7 @@     Edge, Edge8(..),     -- * Construction     empty, fromLists, fromMaps,-    insertNode, insertNodes, adjustNode,+    insertNode, insertNodes, adjustNode, adjustEdge,     insertEdge, insertEdges,     union,     -- * Traversal