mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-10 13:39:08 +08:00
style: do not suppress serial
(#5168)
This commit is contained in:
@ -73,13 +73,6 @@ public final class TopologicalSort {
|
||||
}
|
||||
}
|
||||
|
||||
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 @@ public final class TopologicalSort {
|
||||
*
|
||||
* 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;
|
||||
|
Reference in New Issue
Block a user