Fix

Hardvan · Hardvan · commit a527e9599092 · 2024-10-07T18:29:20.000+05:30
diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/FloydWarshall.java b/src/main/java/com/thealgorithms/datastructures/graphs/FloydWarshall.java
@@ -1,7 +1,5 @@
 package com.thealgorithms.datastructures.graphs;
 
-import java.util.Scanner;
-
 /**
  * The {@code FloydWarshall} class provides an implementation of the Floyd-Warshall algorithm
  * to compute the shortest paths between all pairs of vertices in a weighted graph.
