From 5e2c06036d31ed97aef027902853c57b23a23d59 Mon Sep 17 00:00:00 2001 From: Jonas Smedegaard Date: Mon, 21 Apr 2025 22:43:43 +0200 Subject: improve complexity documentation --- .../bachelorizer/model/Combi.java" | 9 +++------ 1 file changed, 3 insertions(+), 6 deletions(-) (limited to 'dk/abcdefghijklmnopqrstuvxyzæøå') diff --git "a/dk/abcdefghijklmnopqrstuvxyz\303\246\303\270\303\245/bachelorizer/model/Combi.java" "b/dk/abcdefghijklmnopqrstuvxyz\303\246\303\270\303\245/bachelorizer/model/Combi.java" index 6b517f5..1c86e7d 100644 --- "a/dk/abcdefghijklmnopqrstuvxyz\303\246\303\270\303\245/bachelorizer/model/Combi.java" +++ "b/dk/abcdefghijklmnopqrstuvxyz\303\246\303\270\303\245/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 -- cgit v1.2.3