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] 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 f4d7f16a5..1e50dde28 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 1ab8fa8fc..f87843112 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