apache / commons-graphConditional Complexity

Intro

Conditional complexity (also called cyclomatic complexity) is a term used to measure the complexity of software. The term refers to the number of possible paths through a program function. A higher value ofter means higher maintenance and testing costs (infosecinstitute.com).
Conditional complexity is calculated by counting all conditions in the program that can affect the execution path (e.g. if statement, loops, switches, and/or operators, try and catch blocks...).
Conditional complexity is measured at the unit level (methods, functions...).
Units are classified in four categories based on the measured McCabe index: 1-5 (simple units), 6-10 (medium complex units), 11-25 (complex units), 26+ (very complex units).

Learn more...

Conditional Complexity Overall

There are 439 units with 3,293 lines of code in units (52.6% of code).

0 very complex units (0 lines of code)
0 complex units (0 lines of code)
2 medium complex units (139 lines of code)
14 simple units (493 lines of code)
423 very simple units (2,661 lines of code)

Legend:

51+

26-50

11-25

6-10

1-5

Alternative Visuals

3D view of all units

Conditional Complexity per Extension

51+

26-50

11-25

6-10

1-5

Conditional Complexity per Logical Component

primary logical decomposition

51+

26-50

11-25

6-10

1-5

Most Complex Units

Top 50 most complex units

Unit	# lines	McCabe index	# params
private O applyingSearch() in src/main/java/org/apache/commons/graph/visit/DefaultVisitAlgorithmsSelector.java	77	19	2
private void consolidate() in src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java	62	12	0
public ColoredVertices applyingGreedyAlgorithm() in src/main/java/org/apache/commons/graph/coloring/DefaultColoringAlgorithmsSelector.java	42	8	0
public static void setUp() in src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java	60	7	0
public boolean equals() in src/main/java/org/apache/commons/graph/model/InMemoryPath.java	17	7	1
public final void to() in src/main/java/org/apache/commons/graph/export/AbstractExporter.java	51	7	1
private void dfs() in src/main/java/org/apache/commons/graph/scc/CheriyanMehlhornGabowAlgorithm.java	33	7	1
private void calculateDataFlow() in base/src/main/java/org/apache/commons/graph/algorithm/dataflow/DataFlowSolutions.java	33	6	2
public static void setUp() in src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java	45	6	0
private static String getStringType() in src/main/java/org/apache/commons/graph/export/GraphMLExporter.java	24	6	1
private static void strongConnect() in src/main/java/org/apache/commons/graph/scc/TarjanAlgorithm.java	36	6	6
private void searchRecursive() in src/main/java/org/apache/commons/graph/scc/KosarajuSharirAlgorithm.java	32	6	5
public Iterator iterator() in src/main/java/org/apache/commons/graph/coloring/UncoloredOrderedVertices.java	40	6	0
private boolean backtraking() in src/main/java/org/apache/commons/graph/coloring/DefaultColoringAlgorithmsSelector.java	25	6	3
private boolean isThereColorConflict() in src/main/java/org/apache/commons/graph/coloring/DefaultColoringAlgorithmsSelector.java	21	6	2
public String toString() in src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java	34	6	0
public WeightedPath buildPath() in src/main/java/org/apache/commons/graph/shortestpath/PredecessorsList.java	28	5	4
public int compare() in src/main/java/org/apache/commons/graph/shortestpath/ShortestDistances.java	16	5	2
public int compare() in src/main/java/org/apache/commons/graph/spanning/ShortestEdges.java	16	5	2
public void merge() in src/main/java/org/apache/commons/graph/spanning/SuperVertex.java	15	5	1
public WE getMinimumWeightEdge() in src/main/java/org/apache/commons/graph/spanning/SuperVertex.java	15	5	0
public VertexPair getVertices() in src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java	19	5	1
private List getExpandedVertexList() in src/main/java/org/apache/commons/graph/scc/KosarajuSharirAlgorithm.java	26	5	2
public boolean equals() in src/main/java/org/apache/commons/graph/VertexPair.java	15	5	1
void updateResidualNetworkWithCurrentAugmentingPath() in src/main/java/org/apache/commons/graph/flow/FlowNetworkHandler.java	24	5	0
public static void setUp() in src/benchmarks/java/org/apache/commons/graph/scc/SCCAlgorithmBenchmarkTestCase.java	25	4	0
public boolean equals() in src/main/java/org/apache/commons/graph/SynchronizedGraph.java	14	4	1
public boolean equals() in src/main/java/org/apache/commons/graph/model/InMemoryWeightedPath.java	18	4	1
public boolean equals() in src/main/java/org/apache/commons/graph/model/BaseGraph.java	14	4	1
private void printVertexOrEdgeProperties() in src/main/java/org/apache/commons/graph/export/DotExporter.java	15	4	1
public ColoredVertices applyingBackTrackingAlgorithm() in src/main/java/org/apache/commons/graph/coloring/DefaultColoringAlgorithmsSelector.java	17	4	1
public void union() in src/main/java/org/apache/commons/graph/collections/DisjointSet.java	23	4	2
public boolean containsAll() in src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java	15	4	1
public E poll() in src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java	34	4	0
public void connect() in src/main/java/org/apache/commons/graph/flow/DefaultMaxFlowAlgorithmSelector.java	18	4	0
public Integer append() in src/main/java/org/apache/commons/graph/weight/primitive/IntegerWeightBaseOperations.java	8	3	2
public Double append() in src/main/java/org/apache/commons/graph/weight/primitive/DoubleWeightBaseOperations.java	8	3	2
public Float append() in src/main/java/org/apache/commons/graph/weight/primitive/FloatWeightBaseOperations.java	8	3	2
public Long append() in src/main/java/org/apache/commons/graph/weight/primitive/LongWeightBaseOperations.java	8	3	2
public BigDecimal append() in src/main/java/org/apache/commons/graph/weight/primitive/BigDecimalWeightBaseOperations.java	8	3	2
public BigInteger append() in src/main/java/org/apache/commons/graph/weight/primitive/BigIntegerWeightBaseOperations.java	8	3	2
public WeightedPath buildPath() in src/main/java/org/apache/commons/graph/shortestpath/PredecessorsList.java	17	3	2
private void pathReconstruction() in src/main/java/org/apache/commons/graph/shortestpath/DefaultPathSourceSelector.java	19	3	5
public static int hash() in src/main/java/org/apache/commons/graph/utils/Objects.java	9	3	3
public void discoverGraph() in src/main/java/org/apache/commons/graph/visit/VisitGraphBuilder.java	15	3	1
public int hashCode() in src/main/java/org/apache/commons/graph/SynchronizedGraph.java	8	3	0
public int getDegree() in src/main/java/org/apache/commons/graph/model/InMemoryPath.java	11	3	1
public W getWeight() in src/main/java/org/apache/commons/graph/spanning/ShortestEdges.java	13	3	1
public Iterable getConnectedVertices() in src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java	12	3	1
public WE getEdge() in src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java	13	3	2