diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index aaed9ac5d..f4d7f16a5 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -1,3 +1,5 @@
+#!/usr/bin/env python3
+
 # floyd_warshall.py
 """
 The problem is to find the shortest distance between all pairs of vertices in a
@@ -31,6 +33,26 @@ def floyd_warshall(graph, v):
     4. The above is repeated for each vertex k in the graph.
     5. Whenever distance[i][j] is given a new minimum value, next vertex[i][j] is
         updated to the next vertex[i][k].
+
+
+    >>> num_vertices = 3
+    >>> graph = [
+    ...     [float('inf'), float('inf'), float('inf')],
+    ...     [float('inf'), float('inf'), float('inf')],
+    ...     [float('inf'), float('inf'), float('inf')]
+    ... ]
+    >>> for i in range(num_vertices):
+    ...     graph[i][i] = 0.0
+    >>> graph[0][1] = 2
+    >>> graph[1][0] = 1
+    >>> expected = [
+    ...     [0, 2, float('inf')],
+    ...     [1, 0, float('inf')],
+    ...     [float('inf'), float('inf'), 0]
+    ... ]
+    >>> dist, _ = floyd_warshall(graph, num_vertices)
+    >>> dist == expected
+    True
     """
 
     dist = [[float("inf") for _ in range(v)] for _ in range(v)]
diff --git a/graphs/tests/test_graphs_floyd_warshall.py b/graphs/tests/test_graphs_floyd_warshall.py
new file mode 100644
index 000000000..1ab8fa8fc
--- /dev/null
+++ b/graphs/tests/test_graphs_floyd_warshall.py
@@ -0,0 +1,59 @@
+#!/usr/bin/env python3
+
+import pytest
+
+from graphs.graphs_floyd_warshall import floyd_warshall
+
+
+def test_no_edges():
+    graph = [
+        [0, float("inf"), float("inf")],
+        [float("inf"), 0, float("inf")],
+        [float("inf"), float("inf"), 0],
+    ]
+    expected = [
+        [0, float("inf"), float("inf")],
+        [float("inf"), 0, float("inf")],
+        [float("inf"), float("inf"), 0],
+    ]
+    dist, _ = floyd_warshall(graph, 3)
+    assert dist == expected
+
+
+def test_example_input():
+    num_vertices = 3
+    graph = [
+        [float("inf"), float("inf"), float("inf")],
+        [float("inf"), float("inf"), float("inf")],
+        [float("inf"), float("inf"), float("inf")],
+    ]
+    for i in range(num_vertices):
+        graph[i][i] = 0.0
+    graph[0][1] = 2
+    graph[1][0] = 1
+    expected = [
+        [0, 2, float("inf")],
+        [1, 0, float("inf")],
+        [float("inf"), float("inf"), 0],
+    ]
+    dist, _ = floyd_warshall(graph, num_vertices)
+    assert dist == expected
+
+
+if __name__ == "__main__":
+    pytest.main()
+
+
+def test_unreachable_vertices():
+    graph = [
+        [0, 1, float("inf")],
+        [float("inf"), 0, 2],
+        [float("inf"), float("inf"), 0],
+    ]
+    expected = [[0, 1, 3], [float("inf"), 0, 2], [float("inf"), float("inf"), 0]]
+    dist, _ = floyd_warshall(graph, 3)
+    assert dist == expected
+
+
+if __name__ == "__main__":
+    pytest.main()