diff --git a/pom.xml b/pom.xml
index 2c2f640d5e0f..ead4fb6dd0f0 100644
--- a/pom.xml
+++ b/pom.xml
@@ -79,7 +79,6 @@
                         <arg>-Xlint:all</arg>
                         <arg>-Xlint:-auxiliaryclass</arg>
                         <arg>-Xlint:-rawtypes</arg>
-                        <arg>-Xlint:-serial</arg>
                         <arg>-Xlint:-try</arg>
                         <arg>-Xlint:-unchecked</arg>
                         <arg>-Xlint:-lossy-conversions</arg>
diff --git a/src/main/java/com/thealgorithms/sorts/TopologicalSort.java b/src/main/java/com/thealgorithms/sorts/TopologicalSort.java
index ce664b0197fc..dd3a763bb197 100644
--- a/src/main/java/com/thealgorithms/sorts/TopologicalSort.java
+++ b/src/main/java/com/thealgorithms/sorts/TopologicalSort.java
@@ -73,13 +73,6 @@ public void addEdge(String label, String... next) {
         }
     }
 
-    static class BackEdgeException extends RuntimeException {
-
-        BackEdgeException(String backEdge) {
-            super("This graph contains a cycle. No linear ordering is possible. " + backEdge);
-        }
-    }
-
     /*
      * Depth First Search
      *
@@ -131,7 +124,7 @@ private static String sort(Graph graph, Vertex u, LinkedList<String> list) {
                  *
                  * In many cases, we will not know u.f, but v.color denotes the type of edge
                  * */
-                throw new BackEdgeException("Back edge: " + u.label + " -> " + label);
+                throw new RuntimeException("This graph contains a cycle. No linear ordering is possible. Back edge: " + u.label + " -> " + label);
             }
         });
         u.color = Color.BLACK;
diff --git a/src/test/java/com/thealgorithms/sorts/TopologicalSortTest.java b/src/test/java/com/thealgorithms/sorts/TopologicalSortTest.java
index 9fb0fc06a002..de115b458fe7 100644
--- a/src/test/java/com/thealgorithms/sorts/TopologicalSortTest.java
+++ b/src/test/java/com/thealgorithms/sorts/TopologicalSortTest.java
@@ -4,7 +4,6 @@
 import static org.junit.jupiter.api.Assertions.assertIterableEquals;
 import static org.junit.jupiter.api.Assertions.assertThrows;
 
-import com.thealgorithms.sorts.TopologicalSort.BackEdgeException;
 import com.thealgorithms.sorts.TopologicalSort.Graph;
 import java.util.LinkedList;
 import org.junit.jupiter.api.Test;
@@ -55,7 +54,7 @@ public void failureTest() {
         graph.addEdge("6", "2");
         graph.addEdge("7", "");
         graph.addEdge("8", "");
-        Exception exception = assertThrows(BackEdgeException.class, () -> TopologicalSort.sort(graph));
+        Exception exception = assertThrows(RuntimeException.class, () -> TopologicalSort.sort(graph));
         String expected = "This graph contains a cycle. No linear ordering is possible. "
             + "Back edge: 6 -> 2";
         assertEquals(exception.getMessage(), expected);