diff --git a/graphite.cabal b/graphite.cabal
--- a/graphite.cabal
+++ b/graphite.cabal
@@ -1,5 +1,5 @@
 name:                graphite
-version:             0.9.8.0
+version:             0.10.0.0
 synopsis:            Graphs and networks library
 description:         Represent, analyze and visualize graphs
 homepage:            https://github.com/alx741/graphite#readme
diff --git a/src/Data/Graph/DGraph.hs b/src/Data/Graph/DGraph.hs
--- a/src/Data/Graph/DGraph.hs
+++ b/src/Data/Graph/DGraph.hs
@@ -23,10 +23,10 @@
     , indegrees
     , outdegrees
     -- ** Query graph properties and characteristics
-    , isSymmetric
-    , isOriented
+    -- , isSymmetric
+    -- , isOriented
     , isBalanced
-    , isRegular
+    -- , isRegular
     , isSource
     , isSink
     , isInternal
@@ -167,7 +167,7 @@
                 genArcs as (i, vs) = as ++ fmap (\v -> Arc i v ()) connected
                     where connected = fst <$> filter (\(_, v) -> v /= 0) vs
 
-    toAdjacencyMatrix = undefined
+    -- toAdjacencyMatrix = undefined
 
 instance (Arbitrary v, Arbitrary e, Hashable v, Num v, Ord v)
  => Arbitrary (DGraph v e) where
diff --git a/src/Data/Graph/Morphisms.hs b/src/Data/Graph/Morphisms.hs
--- a/src/Data/Graph/Morphisms.hs
+++ b/src/Data/Graph/Morphisms.hs
@@ -1,4 +1,6 @@
-module Data.Graph.Morphisms where
+module Data.Graph.Morphisms
+    ()
+    where
 
 import Data.Graph.DGraph
 import Data.Graph.Types
diff --git a/src/Data/Graph/Types.hs b/src/Data/Graph/Types.hs
--- a/src/Data/Graph/Types.hs
+++ b/src/Data/Graph/Types.hs
@@ -226,7 +226,7 @@
 
     -- TODO: make this [[Bool]]
     -- | Get the adjacency binary matrix representation of a graph
-    toAdjacencyMatrix :: g v e -> [[Int]]
+    -- toAdjacencyMatrix :: g v e -> [[Int]]
 
     -- | Generate a graph of Int vertices from an adjacency square binary matrix
     fromAdjacencyMatrix :: [[Int]] -> Maybe (g Int ())
diff --git a/src/Data/Graph/UGraph.hs b/src/Data/Graph/UGraph.hs
--- a/src/Data/Graph/UGraph.hs
+++ b/src/Data/Graph/UGraph.hs
@@ -144,7 +144,7 @@
                 genEdges es (i, vs) = es ++ fmap (\v -> Edge i v ()) connected
                     where connected = fst <$> filter (\(_, v) -> v /= 0) vs
 
-    toAdjacencyMatrix = undefined
+    -- toAdjacencyMatrix = undefined
 
 
 
diff --git a/src/Data/Graph/UGraph/DegreeSequence.hs b/src/Data/Graph/UGraph/DegreeSequence.hs
--- a/src/Data/Graph/UGraph/DegreeSequence.hs
+++ b/src/Data/Graph/UGraph/DegreeSequence.hs
@@ -8,11 +8,11 @@
 
     -- * Queries
     , isGraphicalSequence
-    , isDirectedGraphic
+    -- , isDirectedGraphic
     , holdsHandshakingLemma
 
     -- * Graph generation
-    , fromGraphicalSequence
+    -- , fromGraphicalSequence
     ) where
 
 import Data.List (reverse, sort)