From 91fd1d8bc8c991706ecf617a54b476c4f367b7a9 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 09:59:27 +0200
Subject: [PATCH 01/20] unit test for graphs_floyd_warshall

---
 graphs/graphs_floyd_warshall.py            | 22 ++++++++
 graphs/tests/test_graphs_floyd_warshall.py | 59 ++++++++++++++++++++++
 2 files changed, 81 insertions(+)
 create mode 100644 graphs/tests/test_graphs_floyd_warshall.py

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index aaed9ac5df8b..f4d7f16a569c 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 000000000000..1ab8fa8fcde9
--- /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()

From e4cb102d50ca7aa372aab2b359b1bf88d8126dda Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 10:00:24 +0200
Subject: [PATCH 02/20] cleaning up

---
 graphs/graphs_floyd_warshall.py            | 2 --
 graphs/tests/test_graphs_floyd_warshall.py | 2 --
 2 files changed, 4 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index f4d7f16a569c..1e50dde28459 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 # floyd_warshall.py
 """
 The problem is to find the shortest distance between all pairs of vertices in a
diff --git a/graphs/tests/test_graphs_floyd_warshall.py b/graphs/tests/test_graphs_floyd_warshall.py
index 1ab8fa8fcde9..f87843112f8c 100644
--- a/graphs/tests/test_graphs_floyd_warshall.py
+++ b/graphs/tests/test_graphs_floyd_warshall.py
@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 import pytest
 
 from graphs.graphs_floyd_warshall import floyd_warshall

From 650f3cf6e10a01fbe6ffedc373967fa7e2957b6c Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 10:13:46 +0200
Subject: [PATCH 03/20] capturing print output

---
 graphs/tests/test_graphs_floyd_warshall.py | 7 ++-----
 1 file changed, 2 insertions(+), 5 deletions(-)

diff --git a/graphs/tests/test_graphs_floyd_warshall.py b/graphs/tests/test_graphs_floyd_warshall.py
index f87843112f8c..aae312aacf6a 100644
--- a/graphs/tests/test_graphs_floyd_warshall.py
+++ b/graphs/tests/test_graphs_floyd_warshall.py
@@ -18,7 +18,7 @@ def test_no_edges():
     assert dist == expected
 
 
-def test_example_input():
+def test_example_input(capsys):
     num_vertices = 3
     graph = [
         [float("inf"), float("inf"), float("inf")],
@@ -35,13 +35,10 @@ def test_example_input():
         [float("inf"), float("inf"), 0],
     ]
     dist, _ = floyd_warshall(graph, num_vertices)
+    _ = capsys.readouterr()
     assert dist == expected
 
 
-if __name__ == "__main__":
-    pytest.main()
-
-
 def test_unreachable_vertices():
     graph = [
         [0, 1, float("inf")],

From 4a6fbdecd25c2d9a931a3f6926211cf52f3e485b Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 10:26:29 +0200
Subject: [PATCH 04/20] editing doctest

---
 graphs/graphs_floyd_warshall.py | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 1e50dde28459..c2259eee7044 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -50,6 +50,12 @@ def floyd_warshall(graph, v):
     ... ]
     >>> dist, _ = floyd_warshall(graph, num_vertices)
     >>> dist == expected
+
+    The shortest path matrix using Floyd Warshall algorithm
+
+    0	2	INF
+    1	0	INF
+    INF	INF	0
     True
     """
 

From e1ad21cd6a4e0caa76684567606d29bb337c7fe3 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 10:42:14 +0200
Subject: [PATCH 05/20] editing doctest

---
 graphs/graphs_floyd_warshall.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index c2259eee7044..77c69d7b1d20 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -49,13 +49,13 @@ def floyd_warshall(graph, v):
     ...     [float('inf'), float('inf'), 0]
     ... ]
     >>> dist, _ = floyd_warshall(graph, num_vertices)
-    >>> dist == expected
 
     The shortest path matrix using Floyd Warshall algorithm
 
     0	2	INF
     1	0	INF
     INF	INF	0
+    >>> dist == expected
     True
     """
 

From 199db3082979fca8bbceb35803e1e0938e6e852e Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 10:51:54 +0200
Subject: [PATCH 06/20] editing doctest

---
 graphs/graphs_floyd_warshall.py | 6 +-----
 1 file changed, 1 insertion(+), 5 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 77c69d7b1d20..926d37c591d4 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -39,17 +39,13 @@ def floyd_warshall(graph, v):
     ...     [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)
-
     The shortest path matrix using Floyd Warshall algorithm
 
     0	2	INF

From d486240774c4267f275930f2d214f4d5b7e94786 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 10:57:46 +0200
Subject: [PATCH 07/20] editing doctest

---
 graphs/graphs_floyd_warshall.py | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 926d37c591d4..2aa111cc2e1d 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -46,8 +46,9 @@ def floyd_warshall(graph, v):
     ...     [float('inf'), float('inf'), 0]
     ... ]
     >>> dist, _ = floyd_warshall(graph, num_vertices)
+    <BLANKLINE>
     The shortest path matrix using Floyd Warshall algorithm
-
+    <BLANKLINE>
     0	2	INF
     1	0	INF
     INF	INF	0

From 84c97dae332b27ff49ba0c82326fa94751671a4e Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:03:24 +0200
Subject: [PATCH 08/20] removing blank lines from print statement

---
 graphs/graphs_floyd_warshall.py | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 2aa111cc2e1d..d7fd62e46a6a 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -6,7 +6,7 @@
 
 
 def _print_dist(dist, v):
-    print("\nThe shortest path matrix using Floyd Warshall algorithm\n")
+    print("The shortest path matrix using Floyd Warshall algorithm")
     for i in range(v):
         for j in range(v):
             if dist[i][j] != float("inf"):
@@ -46,9 +46,7 @@ def floyd_warshall(graph, v):
     ...     [float('inf'), float('inf'), 0]
     ... ]
     >>> dist, _ = floyd_warshall(graph, num_vertices)
-    <BLANKLINE>
     The shortest path matrix using Floyd Warshall algorithm
-    <BLANKLINE>
     0	2	INF
     1	0	INF
     INF	INF	0

From b7d8a03e6f153f401b6240c0d1f99698982be2f7 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:08:16 +0200
Subject: [PATCH 09/20] removing tabs from print statement

---
 graphs/graphs_floyd_warshall.py | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index d7fd62e46a6a..429391175757 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -10,9 +10,9 @@ def _print_dist(dist, v):
     for i in range(v):
         for j in range(v):
             if dist[i][j] != float("inf"):
-                print(int(dist[i][j]), end="\t")
+                print(int(dist[i][j]), end=" ")
             else:
-                print("INF", end="\t")
+                print("INF", end=" ")
         print()
 
 

From e1eb17e83e333fdd01b1a345af61f088b6907c24 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:15:32 +0200
Subject: [PATCH 10/20] commenting out print statement

---
 graphs/graphs_floyd_warshall.py | 12 ++++--------
 1 file changed, 4 insertions(+), 8 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 429391175757..a442b55db51f 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -6,13 +6,13 @@
 
 
 def _print_dist(dist, v):
-    print("The shortest path matrix using Floyd Warshall algorithm")
+    print("\nThe shortest path matrix using Floyd Warshall algorithm\n")
     for i in range(v):
         for j in range(v):
             if dist[i][j] != float("inf"):
-                print(int(dist[i][j]), end=" ")
+                print(int(dist[i][j]), end="\t")
             else:
-                print("INF", end=" ")
+                print("INF", end="\t")
         print()
 
 
@@ -46,10 +46,6 @@ def floyd_warshall(graph, v):
     ...     [float('inf'), float('inf'), 0]
     ... ]
     >>> dist, _ = floyd_warshall(graph, num_vertices)
-    The shortest path matrix using Floyd Warshall algorithm
-    0	2	INF
-    1	0	INF
-    INF	INF	0
     >>> dist == expected
     True
     """
@@ -73,7 +69,7 @@ def floyd_warshall(graph, v):
                 ):
                     dist[i][j] = dist[i][k] + dist[k][j]
 
-    _print_dist(dist, v)
+    # _print_dist(dist, v)
     return dist, v
 
 

From 8be7753175a68f5636234fedbf99a00eb9733b3d Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:26:52 +0200
Subject: [PATCH 11/20] changing pytest

---
 graphs/graphs_floyd_warshall.py            | 13 ++++++-------
 graphs/tests/test_graphs_floyd_warshall.py | 22 ++++------------------
 2 files changed, 10 insertions(+), 25 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index a442b55db51f..b65b68cbed74 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -33,17 +33,16 @@ def floyd_warshall(graph, v):
         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')]
+    ...     [0, 3, float('inf')],
+    ...     [2, 0, float('inf')],
+    ...     [float('inf'), 7, 0]
     ... ]
 
     >>> expected = [
-    ...     [0, 2, float('inf')],
-    ...     [1, 0, float('inf')],
-    ...     [float('inf'), float('inf'), 0]
+    ...     [0, 3, float('inf')],
+    ...     [2, 0, float('inf')],
+    ...     [9, 7, 0]
     ... ]
     >>> dist, _ = floyd_warshall(graph, num_vertices)
     >>> dist == expected
diff --git a/graphs/tests/test_graphs_floyd_warshall.py b/graphs/tests/test_graphs_floyd_warshall.py
index aae312aacf6a..ef8bb230f1c9 100644
--- a/graphs/tests/test_graphs_floyd_warshall.py
+++ b/graphs/tests/test_graphs_floyd_warshall.py
@@ -18,24 +18,10 @@ def test_no_edges():
     assert dist == expected
 
 
-def test_example_input(capsys):
-    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)
-    _ = capsys.readouterr()
+def test_with_edges():
+    graph = [[0, 3, float("inf")], [2, 0, float("inf")], [float("inf"), 7, 0]]
+    expected = [[0, 3, float("inf")], [2, 0, float("inf")], [9, 7, 0]]
+    dist, _ = floyd_warshall(graph, 3)
     assert dist == expected
 
 

From f01de409deb458e28539782f6b68bf637a506183 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:31:28 +0200
Subject: [PATCH 12/20] fixing doctest

---
 graphs/graphs_floyd_warshall.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index b65b68cbed74..33a99fc88596 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -44,7 +44,7 @@ def floyd_warshall(graph, v):
     ...     [2, 0, float('inf')],
     ...     [9, 7, 0]
     ... ]
-    >>> dist, _ = floyd_warshall(graph, num_vertices)
+    >>> dist, _ = floyd_warshall(graph, 3)
     >>> dist == expected
     True
     """

From bf3c0c3de9b4f0244a1f51696592f066bec6f471 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:37:15 +0200
Subject: [PATCH 13/20] including print statement and output in doctest

---
 graphs/graphs_floyd_warshall.py | 9 +++++++--
 1 file changed, 7 insertions(+), 2 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 33a99fc88596..824501403dfa 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -6,7 +6,7 @@
 
 
 def _print_dist(dist, v):
-    print("\nThe shortest path matrix using Floyd Warshall algorithm\n")
+    print("The shortest path matrix using Floyd Warshall algorithm\n")
     for i in range(v):
         for j in range(v):
             if dist[i][j] != float("inf"):
@@ -45,6 +45,11 @@ def floyd_warshall(graph, v):
     ...     [9, 7, 0]
     ... ]
     >>> dist, _ = floyd_warshall(graph, 3)
+    The shortest path matrix using Floyd Warshall algorithm
+
+    0	3	INF
+    2	0	INF
+    9	7	0
     >>> dist == expected
     True
     """
@@ -68,7 +73,7 @@ def floyd_warshall(graph, v):
                 ):
                     dist[i][j] = dist[i][k] + dist[k][j]
 
-    # _print_dist(dist, v)
+    _print_dist(dist, v)
     return dist, v
 
 

From 77edabebb57ecd836ded29ed4d903c133888f795 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:41:26 +0200
Subject: [PATCH 14/20] editing doctest

---
 graphs/graphs_floyd_warshall.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 824501403dfa..0199ccc5900a 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -46,7 +46,7 @@ def floyd_warshall(graph, v):
     ... ]
     >>> dist, _ = floyd_warshall(graph, 3)
     The shortest path matrix using Floyd Warshall algorithm
-
+    <BLANKLINE>
     0	3	INF
     2	0	INF
     9	7	0

From 3e623c14763b34aa27cb406285b56b811299cf31 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:45:49 +0200
Subject: [PATCH 15/20] changing tab to double spaces to capture in doctest

---
 graphs/graphs_floyd_warshall.py | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 0199ccc5900a..629da37af33d 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -10,9 +10,9 @@ def _print_dist(dist, v):
     for i in range(v):
         for j in range(v):
             if dist[i][j] != float("inf"):
-                print(int(dist[i][j]), end="\t")
+                print(int(dist[i][j]), end="  ")
             else:
-                print("INF", end="\t")
+                print("INF", end="  ")
         print()
 
 
@@ -47,9 +47,9 @@ def floyd_warshall(graph, v):
     >>> dist, _ = floyd_warshall(graph, 3)
     The shortest path matrix using Floyd Warshall algorithm
     <BLANKLINE>
-    0	3	INF
-    2	0	INF
-    9	7	0
+    0  3  INF
+    2  0  INF
+    9  7  0
     >>> dist == expected
     True
     """

From be16a1ef9ba376e11e445873bead55040531090a Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 11:57:41 +0200
Subject: [PATCH 16/20] changing end character in print statement

---
 graphs/graphs_floyd_warshall.py | 11 ++++++-----
 1 file changed, 6 insertions(+), 5 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 629da37af33d..c8d8315a288e 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -9,10 +9,11 @@ def _print_dist(dist, v):
     print("The shortest path matrix using Floyd Warshall algorithm\n")
     for i in range(v):
         for j in range(v):
+            end_char = "" if j == v - 1 else "\t"
             if dist[i][j] != float("inf"):
-                print(int(dist[i][j]), end="  ")
+                print(int(dist[i][j]), end=end_char)
             else:
-                print("INF", end="  ")
+                print("INF", end=end_char)
         print()
 
 
@@ -47,9 +48,9 @@ def floyd_warshall(graph, v):
     >>> dist, _ = floyd_warshall(graph, 3)
     The shortest path matrix using Floyd Warshall algorithm
     <BLANKLINE>
-    0  3  INF
-    2  0  INF
-    9  7  0
+    0   3   INF
+    2   0   INF
+    9   7   0
     >>> dist == expected
     True
     """

From 05e81d572494f6fb4c18c5847ace4fc9ee131466 Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 12:02:19 +0200
Subject: [PATCH 17/20] fixing doctests

---
 graphs/graphs_floyd_warshall.py | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index c8d8315a288e..9a5c88943534 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -48,9 +48,9 @@ def floyd_warshall(graph, v):
     >>> dist, _ = floyd_warshall(graph, 3)
     The shortest path matrix using Floyd Warshall algorithm
     <BLANKLINE>
-    0   3   INF
-    2   0   INF
-    9   7   0
+    0	3	INF
+    2	0	INF
+    9	7	0
     >>> dist == expected
     True
     """

From d103325a63fb6e35035a6b440e4b6488cd81bb9f Mon Sep 17 00:00:00 2001
From: "Ajmera, Mahita  SI/HZR-IDSA" <ajmermhi@schaeffler.com>
Date: Thu, 17 Oct 2024 12:07:11 +0200
Subject: [PATCH 18/20] chagning tab to double space for doctest

---
 graphs/graphs_floyd_warshall.py | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index 9a5c88943534..c14053e7a2c9 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -9,7 +9,7 @@ def _print_dist(dist, v):
     print("The shortest path matrix using Floyd Warshall algorithm\n")
     for i in range(v):
         for j in range(v):
-            end_char = "" if j == v - 1 else "\t"
+            end_char = "" if j == v - 1 else "  "
             if dist[i][j] != float("inf"):
                 print(int(dist[i][j]), end=end_char)
             else:
@@ -48,9 +48,9 @@ def floyd_warshall(graph, v):
     >>> dist, _ = floyd_warshall(graph, 3)
     The shortest path matrix using Floyd Warshall algorithm
     <BLANKLINE>
-    0	3	INF
-    2	0	INF
-    9	7	0
+    0  3  INF
+    2  0  INF
+    9  7  0
     >>> dist == expected
     True
     """

From fdd773d305dd53de77250f1858b24dd883d1e238 Mon Sep 17 00:00:00 2001
From: cclauss <cclauss@users.noreply.github.com>
Date: Wed, 16 Sep 2026 13:28:31 +0000
Subject: [PATCH 19/20] updating DIRECTORY.md

---
 DIRECTORY.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/DIRECTORY.md b/DIRECTORY.md
index 99646d31d860..4cf5e10a6bdc 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -640,6 +640,7 @@
   * [Strongly Connected Components](graphs/strongly_connected_components.py)
   * [Tarjans Scc](graphs/tarjans_scc.py)
   * Tests
+    * [Test Graphs Floyd Warshall](graphs/tests/test_graphs_floyd_warshall.py)
     * [Test Johnson](graphs/tests/test_johnson.py)
     * [Test Min Spanning Tree Kruskal](graphs/tests/test_min_spanning_tree_kruskal.py)
     * [Test Min Spanning Tree Prim](graphs/tests/test_min_spanning_tree_prim.py)

From db200cd0e17af121c4f3618af4a424620b578616 Mon Sep 17 00:00:00 2001
From: Christian Clauss <cclauss@me.com>
Date: Wed, 16 Sep 2026 15:33:59 +0200
Subject: [PATCH 20/20] Improve output formatting in Floyd Warshall example

Added a blank line for better readability in the output.
---
 graphs/graphs_floyd_warshall.py | 1 +
 1 file changed, 1 insertion(+)

diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
index ffdc92f5d6a5..c7fcbcbe4a48 100644
--- a/graphs/graphs_floyd_warshall.py
+++ b/graphs/graphs_floyd_warshall.py
@@ -46,6 +46,7 @@ def floyd_warshall(graph, v):
     ...     [9, 7, 0]
     ... ]
     >>> dist, _ = floyd_warshall(graph, 3)
+    <BLANKLINE>
     The shortest path matrix using Floyd Warshall algorithm
     <BLANKLINE>
     0  3  INF