diff --git a/int-like.cabal b/int-like.cabal
--- a/int-like.cabal
+++ b/int-like.cabal
@@ -1,11 +1,11 @@
 cabal-version: 1.12
 
--- This file has been generated from package.yaml by hpack version 0.36.0.
+-- This file has been generated from package.yaml by hpack version 0.37.0.
 --
 -- see: https://github.com/sol/hpack
 
 name:           int-like
-version:        0.1.2
+version:        0.1.3
 synopsis:       Newtype wrappers over IntSet and IntMap
 description:    Please see the README on GitHub at <https://github.com/ejconlon/int-like#readme>
 category:       Data Structures
diff --git a/src/IntLike/Equiv.hs b/src/IntLike/Equiv.hs
--- a/src/IntLike/Equiv.hs
+++ b/src/IntLike/Equiv.hs
@@ -25,7 +25,7 @@
   { fwdView :: !(IntLikeMultiMap k v)
   , bwdView :: !(IntLikeMap v k)
   }
-  deriving stock (Eq, Show, Generic)
+  deriving stock (Eq, Ord, Show, Generic)
   deriving anyclass (NFData)
 
 empty :: IntLikeEquiv k v
diff --git a/src/IntLike/Graph.hs b/src/IntLike/Graph.hs
--- a/src/IntLike/Graph.hs
+++ b/src/IntLike/Graph.hs
@@ -27,7 +27,7 @@
 import qualified IntLike.Set as ILS
 
 newtype IntLikeGraph x = IntLikeGraph {unIntLikeGraph :: AdjacencyIntMap}
-  deriving newtype (Eq, Show, NFData)
+  deriving newtype (Eq, Ord, Show, NFData)
 
 instance Coercible x Int => Graph (IntLikeGraph x) where
   type Vertex (IntLikeGraph x) = x
diff --git a/src/IntLike/Map.hs b/src/IntLike/Map.hs
--- a/src/IntLike/Map.hs
+++ b/src/IntLike/Map.hs
@@ -36,7 +36,7 @@
 
 newtype IntLikeMap x a = IntLikeMap {unIntLikeMap :: IntMap a}
   deriving stock (Show, Traversable)
-  deriving newtype (Eq, Functor, Foldable, NFData, Semigroup, Monoid)
+  deriving newtype (Eq, Ord, Functor, Foldable, NFData, Semigroup, Monoid)
 
 empty :: IntLikeMap x a
 empty = IntLikeMap IntMap.empty
diff --git a/src/IntLike/Set.hs b/src/IntLike/Set.hs
--- a/src/IntLike/Set.hs
+++ b/src/IntLike/Set.hs
@@ -34,7 +34,7 @@
 
 newtype IntLikeSet x = IntLikeSet {unIntLikeSet :: IntSet}
   deriving stock (Show)
-  deriving newtype (Eq, NFData, Semigroup, Monoid)
+  deriving newtype (Eq, Ord, NFData, Semigroup, Monoid)
 
 empty :: IntLikeSet x
 empty = IntLikeSet IntSet.empty