improve complexity documentation

1 files changed, 3 insertions, 6 deletions

diff --git a/dk/abcdefghijklmnopqrstuvxyzæøå/bachelorizer/model/Combi.java b/dk/abcdefghijklmnopqrstuvxyzæøå/bachelorizer/model/Combi.java
index 6b517f5..1c86e7d 100644
--- a/dk/abcdefghijklmnopqrstuvxyzæøå/bachelorizer/model/Combi.java
+++ b/dk/abcdefghijklmnopqrstuvxyzæøå/bachelorizer/model/Combi.java
@@ -77,12 +77,9 @@ public final class Combi {
 	/// If check fails, throw an unchecked exception,
 	/// since it occurs at runtime and is unrecoverable.
 	///
-	/// Complexity of the operation is O(min(2n,n²,n*m+1))
-	/// where n is the amount of vertices and m is amount of edges,
-	/// since visitDepthFirst() recurses out-edges of all vertices,
-	/// and a connected graph has at least one out-edge per vertex
-	/// (arguably complexity is merely O(2n,n²)
-	/// since an unconnected graph is treated an as exception).
+	/// Time complexity of the operation is O(n²)
+	/// where n is the amount of vertices,
+	/// since visitDepthFirst() recurses out-edges of all vertices.
 	///
 	/// @param g  Graph to inspect
 	/// @throws IllegalArgumentException