packages feed

graphs 0.3.2.3 → 0.4

raw patch · 4 files changed

+8/−18 lines, 4 filesdep −data-defaultdep ~arraydep ~transformersdep ~voidPVP ok

version bump matches the API change (PVP)

Dependencies removed: data-default

Dependency ranges changed: array, transformers, void

API changes (from Hackage documentation)

- Data.Graph.Algorithm.BreadthFirstSearch: instance (Graph g, Monoid m) => Default (Bfs g m)
- Data.Graph.Algorithm.DepthFirstSearch: instance (Graph g, Monoid m) => Default (Dfs g m)
- Data.Graph.Class: class (Monad g, Eq (Vertex g), Eq (Edge g)) => Graph g where { type family Vertex g :: *; type family Edge g :: *; }
+ Data.Graph.Class: class (Monad g, Eq (Vertex g), Eq (Edge g)) => Graph g where type family Vertex g :: * type family Edge g :: *
- Data.Graph.Class: liftEdgeMap :: (MonadTrans t, Graph (t g), Graph g, (Edge (t g)) ~ (Edge g)) => a -> t g (EdgeMap (t g) a)
+ Data.Graph.Class: liftEdgeMap :: (MonadTrans t, Graph (t g), Graph g, Edge (t g) ~ Edge g) => a -> t g (EdgeMap (t g) a)
- Data.Graph.Class: liftVertexMap :: (MonadTrans t, Graph (t g), Graph g, (Vertex (t g)) ~ (Vertex g)) => a -> t g (VertexMap (t g) a)
+ Data.Graph.Class: liftVertexMap :: (MonadTrans t, Graph (t g), Graph g, Vertex (t g) ~ Vertex g) => a -> t g (VertexMap (t g) a)
- Data.Graph.Class.AdjacencyList: class Graph g => AdjacencyListGraph g
+ Data.Graph.Class.AdjacencyList: class Graph g => AdjacencyListGraph g where outDegree v = liftM length (outEdges v) adjacentVertices = outEdges >=> mapM target
- Data.Graph.Class.Bidirectional: class AdjacencyListGraph g => BidirectionalGraph g
+ Data.Graph.Class.Bidirectional: class AdjacencyListGraph g => BidirectionalGraph g where inDegree v = length `liftM` inEdges v incidentEdges v = liftM2 (++) (inEdges v) (outEdges v) degree v = liftM2 (+) (inDegree v) (outDegree v)

Files

Data/Graph/AdjacencyMatrix.hs view
@@ -18,7 +18,6 @@  import Control.Applicative import Data.Ix-import Data.Functor import Data.Array.IArray import Data.Graph.PropertyMap import Data.Graph.Class
Data/Graph/Algorithm/BreadthFirstSearch.hs view
@@ -20,7 +20,6 @@ import Control.Monad import Control.Monad.Trans.Class import Control.Monad.Trans.State.Strict-import Data.Default import Data.Foldable import Data.Monoid import Data.Sequence@@ -65,9 +64,6 @@     (\e -> grayTarget m e >>= ($ e) . grayTarget . f)     (\v -> exitVertex m v >>= ($ v) . exitVertex . f)     (\e -> blackTarget m e >>= ($ e) . blackTarget . f)--instance (Graph g, Monoid m) => Default (Bfs g m) where-  def = return mempty  instance (Graph g, Monoid m) => Monoid (Bfs g m) where   mempty = return mempty
Data/Graph/Algorithm/DepthFirstSearch.hs view
@@ -20,7 +20,6 @@ import Control.Monad import Control.Monad.Trans.Class import Control.Monad.Trans.State.Strict-import Data.Default import Data.Foldable import Data.Monoid @@ -63,9 +62,6 @@     (\e -> grayTarget m e >>= ($ e) . grayTarget . f)     (\v -> exitVertex m v >>= ($ v) . exitVertex . f)     (\e -> blackTarget m e >>= ($ e) . blackTarget . f)--instance (Graph g, Monoid m) => Default (Dfs g m) where-  def = return mempty  instance (Graph g, Monoid m) => Monoid (Dfs g m) where   mempty = return mempty
graphs.cabal view
@@ -1,6 +1,6 @@ name:          graphs category:      Data Structures-version:       0.3.2.3+version:       0.4 license:       BSD3 cabal-version: >= 1.6 license-file:  LICENSE@@ -22,13 +22,12 @@     TypeFamilies     FlexibleContexts -  build-depends: -    base         >= 4 && < 5,-    array        >= 0.3 && < 0.5,-    data-default >= 0.2 && < 0.3,-    transformers >= 0.2.2 && < 0.3,-    containers   >= 0.3 && < 0.5,-    void         >= 0.5.4.3 && < 0.6+  build-depends:+    base         >= 4       && < 5,+    array        >= 0.4     && < 0.5,+    transformers >= 0.2.2   && < 0.4,+    containers   >= 0.3     && < 0.5,+    void         >= 0.5.5.1 && < 0.6    exposed-modules:     Data.Graph.AdjacencyList@@ -46,4 +45,4 @@   other-modules:     Data.Graph.Internal.Color -  ghc-options: -Wall +  ghc-options: -Wall