diff --git a/src/Data/Graph/Unordered.hs b/src/Data/Graph/Unordered.hs
--- a/src/Data/Graph/Unordered.hs
+++ b/src/Data/Graph/Unordered.hs
@@ -276,13 +276,13 @@
 neighbours g n = maybe [] (map (getNode . otherN n . fst . (edgeMap g HM.!)) . fst)
                  $ ninfo g n
 
-hasEdge :: (ValidGraph et n) => Graph et n nl el -> Edge -> Bool
+hasEdge :: Graph et n nl el -> Edge -> Bool
 hasEdge g e = HM.member e (edgeMap g)
 
-einfo :: (ValidGraph et n) => Graph et n nl el -> Edge -> Maybe (et n, el)
+einfo :: Graph et n nl el -> Edge -> Maybe (et n, el)
 einfo g = (`HM.lookup` edgeMap g)
 
-elab :: (ValidGraph et n) => Graph et n nl el -> Edge -> Maybe el
+elab :: Graph et n nl el -> Edge -> Maybe el
 elab g = fmap snd . einfo g
 
 nodes :: Graph et n nl el -> [n]
@@ -449,16 +449,16 @@
 
 -- -----------------------------------------------------------------------------
 
-nmap :: (ValidGraph et n) => (nl -> nl') -> Graph et n nl el -> Graph et n nl' el
+nmap :: (nl -> nl') -> Graph et n nl el -> Graph et n nl' el
 nmap f = withNodeMap (HM.map (second f))
 
 nmapFor :: (ValidGraph et n) => (nl -> nl) -> Graph et n nl el -> n
            -> Graph et n nl el
 nmapFor f g n = withNodeMap (HM.adjust (second f) n) g
 
-emap :: (ValidGraph et n) => (el -> el') -> Graph et n nl el -> Graph et n nl el'
+emap :: (el -> el') -> Graph et n nl el -> Graph et n nl el'
 emap f = withEdgeMap (HM.map (second f))
 
-emapFor :: (ValidGraph et n) => (el -> el) -> Graph et n nl el -> Edge
+emapFor :: (el -> el) -> Graph et n nl el -> Edge
            -> Graph et n nl el
 emapFor f g e = withEdgeMap (HM.adjust (second f) e) g
diff --git a/unordered-graphs.cabal b/unordered-graphs.cabal
--- a/unordered-graphs.cabal
+++ b/unordered-graphs.cabal
@@ -1,5 +1,5 @@
 name:                unordered-graphs
-version:             0.1.0
+version:             0.1.0.1
 synopsis:            Graph library using unordered-containers
 description:         Simple graph library allowing any Hashable instance
                      to be a node type.
@@ -25,13 +25,12 @@
                      , Data.Graph.Unordered.Internal
   -- other-modules:
   -- other-extensions:
-  build-depends:       base >=4.8 && <4.9
+  build-depends:       base >=4.8 && <4.10
                      , deepseq >= 1.4.0.0
-                     , dlist >= 0.5 && < 0.8
+                     , dlist >= 0.5 && < 0.9
                      , hashable
                      , unordered-containers == 0.2.*
   hs-source-dirs:      src
   default-language:    Haskell2010
 
   ghc-options:       -Wall
-  ghc-prof-options:  -prof