diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,5 +1,9 @@
 # Revision history for digraph
 
+## 0.2.2 -- 2021-08-02
+
+* Support for `massiv >=1.01`
+
 ## 0.2.1 -- 2021-06-24
 
 * Build with GHC-9
diff --git a/LICENSE b/LICENSE
--- a/LICENSE
+++ b/LICENSE
@@ -1,4 +1,4 @@
-Copyright (c) 2019, Kadena LLC
+Copyright (c) 2019-2021, Kadena LLC
 
 All rights reserved.
 
diff --git a/digraph.cabal b/digraph.cabal
--- a/digraph.cabal
+++ b/digraph.cabal
@@ -1,6 +1,6 @@
 cabal-version: 2.4
 name: digraph
-version: 0.2.1
+version: 0.2.2
 synopsis: Directed Graphs
 description: Directed graphs implementation that is based on unordered-containers
 homepage: https://github.com/kadena-io/digraph
diff --git a/src/Data/DiGraph/FloydWarshall.hs b/src/Data/DiGraph/FloydWarshall.hs
--- a/src/Data/DiGraph/FloydWarshall.hs
+++ b/src/Data/DiGraph/FloydWarshall.hs
@@ -8,7 +8,7 @@
 
 -- |
 -- Module: Data.DiGraph.FloydWarshall
--- Copyright: Copyright © 2018 Kadena LLC.
+-- Copyright: Copyright © 2018-2021 Kadena LLC.
 -- License: MIT
 -- Maintainer: Lars Kuhtz <lars@kadena.io>
 -- Stability: experimental
@@ -156,7 +156,11 @@
 --
 intDistMatrix
     :: Real a
+#if MIN_VERSION_massiv(1,0,0)
+    => Source r a
+#else
     => Source r Ix2 a
+#endif
     => Array r Ix2 a
     -> Array M.D Ix2 (Double, Int)
 intDistMatrix = M.imap go
@@ -194,7 +198,11 @@
 -- | Floyd Warshall Without Paths (more efficient, by factor of 2).
 --
 distMatrix_
+#if MIN_VERSION_massiv(1,0,0)
+    :: Source r Int
+#else
     :: Source r Ix2 Int
+#endif
     => Array r Ix2 Int
     -> Array M.D Ix2 Double
 distMatrix_ = M.imap go