diff --git a/Data/Graph/ArraySCC.hs b/Data/Graph/ArraySCC.hs
--- a/Data/Graph/ArraySCC.hs
+++ b/Data/Graph/ArraySCC.hs
@@ -32,14 +32,14 @@
   )
 
 type Func s a =
-     Graph                    -- ^ The original graph
-  -> STUArray s Vertex Int    -- ^ Index in DFS traversal, or SCC for vertex.
+     Graph                    -- The original graph
+  -> STUArray s Vertex Int    -- Index in DFS traversal, or SCC for vertex.
     -- Legend for the index array:
     --    0:    Node not visited
     --    -ve:  Node is on the stack with the given number
     --    +ve:  Node belongs to the SCC with the given number
-  -> STUArray s Vertex Int    -- ^ Least reachable node
-  -> S                        -- ^ State
+  -> STUArray s Vertex Int    -- Least reachable node
+  -> S                        -- State
   -> a
 
 data S = S { stack    :: ![Vertex]          -- ^ Traversal stack
diff --git a/GraphSCC.cabal b/GraphSCC.cabal
--- a/GraphSCC.cabal
+++ b/GraphSCC.cabal
@@ -1,5 +1,5 @@
 Name:             GraphSCC
-Version:          1.0
+Version:          1.0.1
 License:          BSD3
 License-file:     LICENSE
 Author:           Iavor S. Diatchki