diff --git a/Data/Graph/Inductive/PatriciaTree.hs b/Data/Graph/Inductive/PatriciaTree.hs
--- a/Data/Graph/Inductive/PatriciaTree.hs
+++ b/Data/Graph/Inductive/PatriciaTree.hs
@@ -1,4 +1,4 @@
-{-# LANGUAGE ScopedTypeVariables #-}
+{-# LANGUAGE BangPatterns, ScopedTypeVariables #-}
 
 -- |An efficient implementation of 'Data.Graph.Inductive.Graph.Graph'
 -- using big-endian patricia tree (i.e. "Data.IntMap").
diff --git a/fgl.cabal b/fgl.cabal
--- a/fgl.cabal
+++ b/fgl.cabal
@@ -1,42 +1,50 @@
-name:		fgl
-version:	5.4.2.3
-license:	BSD3
-license-file:	LICENSE
-author:	        Martin Erwig, Ivan Lazar Miljenovic
-maintainer:	Ivan.Miljenovic@gmail.com, tomberek@gmail.com
-homepage:	http://web.engr.oregonstate.edu/~erwig/fgl/haskell
-category:	Data Structures
-synopsis:	Martin Erwig's Functional Graph Library
-exposed-modules:
-	Data.Graph.Inductive.Internal.FiniteMap,
-	Data.Graph.Inductive.Internal.Heap,
-	Data.Graph.Inductive.Internal.Queue,
-	Data.Graph.Inductive.Internal.RootPath,
-	Data.Graph.Inductive.Internal.Thread,
-	Data.Graph.Inductive.Basic,
-	Data.Graph.Inductive.Example,
-	Data.Graph.Inductive.Graph,
-	Data.Graph.Inductive.Graphviz,
-	Data.Graph.Inductive.Monad,
-	Data.Graph.Inductive.NodeMap,
-    Data.Graph.Inductive.PatriciaTree,
-	Data.Graph.Inductive.Query,
-	Data.Graph.Inductive.Tree,
-	Data.Graph.Inductive.Monad.IOArray,
-	Data.Graph.Inductive.Query.ArtPoint,
-	Data.Graph.Inductive.Query.BCC,
-	Data.Graph.Inductive.Query.BFS,
-	Data.Graph.Inductive.Query.DFS,
-	Data.Graph.Inductive.Query.Dominators,
-	Data.Graph.Inductive.Query.GVD,
-	Data.Graph.Inductive.Query.Indep,
-	Data.Graph.Inductive.Query.MST,
-	Data.Graph.Inductive.Query.MaxFlow,
-	Data.Graph.Inductive.Query.MaxFlow2,
-	Data.Graph.Inductive.Query.Monad,
-	Data.Graph.Inductive.Query.SP,
-	Data.Graph.Inductive.Query.TransClos,
-	Data.Graph.Inductive
-build-depends:	base < 5, mtl, containers, array
-extensions: MultiParamTypeClasses, OverlappingInstances, FlexibleInstances, ScopedTypeVariables
-build-type: Simple
+name:          fgl
+version:       5.4.2.4
+license:       BSD3
+license-file:  LICENSE
+author:        Martin Erwig, Ivan Lazar Miljenovic
+maintainer:    Ivan.Miljenovic@gmail.com, tomberek@gmail.com
+homepage:      http://web.engr.oregonstate.edu/~erwig/fgl/haskell
+category:      Data Structures, Graphs
+synopsis:      Martin Erwig's Functional Graph Library
+cabal-version: >= 1.6
+build-type:    Simple
+
+source-repository head
+    type:         darcs
+    location:     http://code.haskell.org/FGL/fgl-5
+
+library {
+    exposed-modules:
+        Data.Graph.Inductive.Internal.FiniteMap,
+        Data.Graph.Inductive.Internal.Heap,
+        Data.Graph.Inductive.Internal.Queue,
+        Data.Graph.Inductive.Internal.RootPath,
+        Data.Graph.Inductive.Internal.Thread,
+        Data.Graph.Inductive.Basic,
+        Data.Graph.Inductive.Example,
+        Data.Graph.Inductive.Graph,
+        Data.Graph.Inductive.Graphviz,
+        Data.Graph.Inductive.Monad,
+        Data.Graph.Inductive.NodeMap,
+        Data.Graph.Inductive.PatriciaTree,
+        Data.Graph.Inductive.Query,
+        Data.Graph.Inductive.Tree,
+        Data.Graph.Inductive.Monad.IOArray,
+        Data.Graph.Inductive.Query.ArtPoint,
+        Data.Graph.Inductive.Query.BCC,
+        Data.Graph.Inductive.Query.BFS,
+        Data.Graph.Inductive.Query.DFS,
+        Data.Graph.Inductive.Query.Dominators,
+        Data.Graph.Inductive.Query.GVD,
+        Data.Graph.Inductive.Query.Indep,
+        Data.Graph.Inductive.Query.MST,
+        Data.Graph.Inductive.Query.MaxFlow,
+        Data.Graph.Inductive.Query.MaxFlow2,
+        Data.Graph.Inductive.Query.Monad,
+        Data.Graph.Inductive.Query.SP,
+        Data.Graph.Inductive.Query.TransClos,
+        Data.Graph.Inductive
+    build-depends:    base < 5, mtl, containers, array
+    extensions: MultiParamTypeClasses, OverlappingInstances, FlexibleInstances, ScopedTypeVariables
+}