JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 100 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDijkstraGnm_jmhTest S 15 testDijkstraGnm S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 2 10 edgeDegree 2 2 50 3 500 13 numOfVertices 1 5 10000 U 12 MILLISECONDS E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 105 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDijkstraComplete_jmhTest S 20 testDijkstraComplete S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 1 13 numOfVertices 3 4 1000 4 2000 4 3000 U 12 MILLISECONDS E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 100 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDijkstraGnp_jmhTest S 15 testDijkstraGnp S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 2 13 numOfVertices 1 5 10000 1 p 2 4 0.01 4 0.05 U 12 MILLISECONDS E E 
JMH S 122 org.jgrapht.perf.matching.PathGrowingWeightedMatchingPerformanceTest.EdmondsMaximumCardinalityMatchingRandomGraphBenchmark S 144 org.jgrapht.perf.matching.generated.PathGrowingWeightedMatchingPerformanceTest_EdmondsMaximumCardinalityMatchingRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 81 org.jgrapht.perf.graph.GraphPerformanceTest.MemoryEfficientDirectedGraphBenchmark S 125 org.jgrapht.perf.graph.generated.GraphPerformanceTest_MemoryEfficientDirectedGraphBenchmark_graphPerformanceBenchmark_jmhTest S 25 graphPerformanceBenchmark S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 101 org.jgrapht.perf.lca.LowestCommonAncestorAlgorithmPerformanceTest.BinaryLiftingLCARandomTreeBenchmark S 123 org.jgrapht.perf.lca.generated.LowestCommonAncestorAlgorithmPerformanceTest_BinaryLiftingLCARandomTreeBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 94 org.jgrapht.perf.lca.LowestCommonAncestorAlgorithmPerformanceTest.TarjanLCARandomTreeBenchmark S 116 org.jgrapht.perf.lca.generated.LowestCommonAncestorAlgorithmPerformanceTest_TarjanLCARandomTreeBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 76 org.jgrapht.perf.graph.GraphPerformanceTest.FastLookupDirectedGraphBenchmark S 120 org.jgrapht.perf.graph.generated.GraphPerformanceTest_FastLookupDirectedGraphBenchmark_graphPerformanceBenchmark_jmhTest S 25 graphPerformanceBenchmark S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 94 org.jgrapht.perf.flow.MaximumFlowAlgorithmPerformanceTest.DinicMaximumFlowRandomGraphBenchmark S 116 org.jgrapht.perf.flow.generated.MaximumFlowAlgorithmPerformanceTest_DinicMaximumFlowRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 88 org.jgrapht.perf.graph.DirectedAcyclicGraphPerformanceTest.BitSetDAGRandomGraphBenchmark S 110 org.jgrapht.perf.graph.generated.DirectedAcyclicGraphPerformanceTest_BitSetDAGRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 110 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDeltaSteppingComplete_jmhTest S 25 testDeltaSteppingComplete S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 1 13 numOfVertices 3 4 1000 4 2000 4 3000 U 12 MILLISECONDS E E 
JMH S 100 org.jgrapht.perf.lca.LowestCommonAncestorAlgorithmPerformanceTest.EulerTourRMQLCARandomTreeBenchmark S 122 org.jgrapht.perf.lca.generated.LowestCommonAncestorAlgorithmPerformanceTest_EulerTourRMQLCARandomTreeBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 106 org.jgrapht.perf.clique.MaximalCliqueEnumerationPerformanceTest.DegeneracyBronKerboschRandomGraphBenchmark S 128 org.jgrapht.perf.clique.generated.MaximalCliqueEnumerationPerformanceTest_DegeneracyBronKerboschRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 103 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testBellmanFordGnp_jmhTest S 18 testBellmanFordGnp S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 2 13 numOfVertices 1 5 10000 1 p 2 4 0.01 4 0.05 U 12 MILLISECONDS E E 
JMH S 76 org.jgrapht.perf.graph.GraphPerformanceTest.FastLookupDirectedGraphBenchmark S 117 org.jgrapht.perf.graph.generated.GraphPerformanceTest_FastLookupDirectedGraphBenchmark_generateGraphBenchmark_jmhTest S 22 generateGraphBenchmark S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 103 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testBellmanFordGnm_jmhTest S 18 testBellmanFordGnm S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 2 10 edgeDegree 2 2 50 3 500 13 numOfVertices 1 5 10000 U 12 MILLISECONDS E E 
JMH S 100 org.jgrapht.perf.flow.MaximumFlowAlgorithmPerformanceTest.EdmondsKarpMaximumFlowRandomGraphBenchmark S 122 org.jgrapht.perf.flow.generated.MaximumFlowAlgorithmPerformanceTest_EdmondsKarpMaximumFlowRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 112 org.jgrapht.perf.graph.DirectedAcyclicGraphVSStaticGraphPerformanceTest.DynamicCycleDetectorRandomGraphBenchmark S 134 org.jgrapht.perf.graph.generated.DirectedAcyclicGraphVSStaticGraphPerformanceTest_DynamicCycleDetectorRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 102 org.jgrapht.perf.lca.LowestCommonAncestorAlgorithmPerformanceTest.EulerTourRMQLCARandomForestBenchmark S 124 org.jgrapht.perf.lca.generated.LowestCommonAncestorAlgorithmPerformanceTest_EulerTourRMQLCARandomForestBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 112 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testBellmanFordWattsStogatz_jmhTest S 27 testBellmanFordWattsStogatz S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 3 1 k 2 3 100 4 1000 13 numOfVertices 1 5 10000 1 p 2 4 0.05 3 0.5 U 12 MILLISECONDS E E 
JMH S 116 org.jgrapht.perf.matching.PathGrowingWeightedMatchingPerformanceTest.PathGrowingWeightedMatchingRandomGraphBenchmark S 138 org.jgrapht.perf.matching.generated.PathGrowingWeightedMatchingPerformanceTest_PathGrowingWeightedMatchingRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 114 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testBellmanFordBarabasiAlbert_jmhTest S 29 testBellmanFordBarabasiAlbert S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 3 1 m 2 2 50 3 500 2 m0 1 4 1000 13 numOfVertices 1 5 10000 U 12 MILLISECONDS E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 108 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testBellmanFordComplete_jmhTest S 23 testBellmanFordComplete S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 1 13 numOfVertices 3 4 1000 4 2000 4 3000 U 12 MILLISECONDS E E 
JMH S 111 org.jgrapht.perf.matching.PathGrowingWeightedMatchingPerformanceTest.GreedyWeightedMatchingRandomGraphBenchmark S 133 org.jgrapht.perf.matching.generated.PathGrowingWeightedMatchingPerformanceTest_GreedyWeightedMatchingRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 90 org.jgrapht.perf.matching.blossom.v5.KolmogorovMinimumWeightPerfectMatchingPerformanceTest S 121 org.jgrapht.perf.matching.blossom.v5.generated.KolmogorovMinimumWeightPerfectMatchingPerformanceTest_testBlossomV_jmhTest S 12 testBlossomV S 10 SampleTime E A 1 1 1 E I 1 2 T 3 5 s E I 2 10 T 3 8 s E I 1 5 I 1 0 E E E E M 2 9 graphSize 2 3 300 3 500 9 optionNum 24 1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 U 12 MILLISECONDS E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 105 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDeltaSteppingGnm_jmhTest S 20 testDeltaSteppingGnm S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 2 10 edgeDegree 2 2 50 3 500 13 numOfVertices 1 5 10000 U 12 MILLISECONDS E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 105 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDeltaSteppingGnp_jmhTest S 20 testDeltaSteppingGnp S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 2 13 numOfVertices 1 5 10000 1 p 2 4 0.01 4 0.05 U 12 MILLISECONDS E E 
JMH S 101 org.jgrapht.perf.clique.MaximalCliqueEnumerationPerformanceTest.PivotBronKerboschRandomGraphBenchmark S 123 org.jgrapht.perf.clique.generated.MaximalCliqueEnumerationPerformanceTest_PivotBronKerboschRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 114 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDeltaSteppingWattsStogatz_jmhTest S 29 testDeltaSteppingWattsStogatz S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 3 1 k 2 3 100 4 1000 13 numOfVertices 1 5 10000 1 p 2 4 0.05 3 0.5 U 12 MILLISECONDS E E 
JMH S 96 org.jgrapht.perf.lca.LowestCommonAncestorAlgorithmPerformanceTest.HeavyPathRandomForestBenchmark S 118 org.jgrapht.perf.lca.generated.LowestCommonAncestorAlgorithmPerformanceTest_HeavyPathRandomForestBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 96 org.jgrapht.perf.clique.MaximalCliqueEnumerationPerformanceTest.BronKerboschRandomGraphBenchmark S 118 org.jgrapht.perf.clique.generated.MaximalCliqueEnumerationPerformanceTest_BronKerboschRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 116 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDeltaSteppingBarabasiAlbert_jmhTest S 31 testDeltaSteppingBarabasiAlbert S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 3 1 m 2 2 50 3 500 2 m0 1 4 1000 13 numOfVertices 1 5 10000 U 12 MILLISECONDS E E 
JMH S 124 org.jgrapht.perf.matching.MaximumCardinalityBipartiteMatchingPerformanceTest.EdmondsMaxCardinalityBipartiteMatchingBenchmark S 146 org.jgrapht.perf.matching.generated.MaximumCardinalityBipartiteMatchingPerformanceTest_EdmondsMaxCardinalityBipartiteMatchingBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 111 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDijkstraBarabasiAlbert_jmhTest S 26 testDijkstraBarabasiAlbert S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 3 1 m 2 2 50 3 500 2 m0 1 4 1000 13 numOfVertices 1 5 10000 U 12 MILLISECONDS E E 
JMH S 91 org.jgrapht.perf.graph.DirectedAcyclicGraphPerformanceTest.ArrayListDAGRandomGraphBenchmark S 113 org.jgrapht.perf.graph.generated.DirectedAcyclicGraphPerformanceTest_ArrayListDAGRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 103 org.jgrapht.perf.lca.LowestCommonAncestorAlgorithmPerformanceTest.BinaryLiftingLCARandomForestBenchmark S 125 org.jgrapht.perf.lca.generated.LowestCommonAncestorAlgorithmPerformanceTest_BinaryLiftingLCARandomForestBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 81 org.jgrapht.perf.graph.GraphPerformanceTest.MemoryEfficientDirectedGraphBenchmark S 122 org.jgrapht.perf.graph.generated.GraphPerformanceTest_MemoryEfficientDirectedGraphBenchmark_generateGraphBenchmark_jmhTest S 22 generateGraphBenchmark S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 87 org.jgrapht.perf.graph.DirectedAcyclicGraphPerformanceTest.ArrayDAGRandomGraphBenchmark S 109 org.jgrapht.perf.graph.generated.DirectedAcyclicGraphPerformanceTest_ArrayDAGRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 128 org.jgrapht.perf.matching.PathGrowingWeightedMatchingPerformanceTest.PathGrowingWeightedMatchingNoHeuristicsRandomGraphBenchmark S 150 org.jgrapht.perf.matching.generated.PathGrowingWeightedMatchingPerformanceTest_PathGrowingWeightedMatchingNoHeuristicsRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 89 org.jgrapht.perf.graph.DirectedAcyclicGraphPerformanceTest.HashSetDAGRandomGraphBenchmark S 111 org.jgrapht.perf.graph.generated.DirectedAcyclicGraphPerformanceTest_HashSetDAGRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 66 org.jgrapht.perf.shortestpath.DeltaSteppingShortestPathPerformance S 109 org.jgrapht.perf.shortestpath.generated.DeltaSteppingShortestPathPerformance_testDijkstraWattsStogatz_jmhTest S 24 testDijkstraWattsStogatz S 11 AverageTime E A 1 1 1 E I 1 3 T 4 10 s E I 1 8 T 4 10 s E I 1 1 I 1 0 E E E E M 3 1 k 2 3 100 4 1000 13 numOfVertices 1 5 10000 1 p 2 4 0.05 3 0.5 U 12 MILLISECONDS E E 
JMH S 120 org.jgrapht.perf.graph.DirectedAcyclicGraphVSStaticGraphPerformanceTest.StaticGraphWithCycleDetectorRandomGraphBenchmark S 142 org.jgrapht.perf.graph.generated.DirectedAcyclicGraphVSStaticGraphPerformanceTest_StaticGraphWithCycleDetectorRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 100 org.jgrapht.perf.flow.MaximumFlowAlgorithmPerformanceTest.PushRelabelMaximumFlowRandomGraphBenchmark S 122 org.jgrapht.perf.flow.generated.MaximumFlowAlgorithmPerformanceTest_PushRelabelMaximumFlowRandomGraphBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 96 org.jgrapht.perf.lca.LowestCommonAncestorAlgorithmPerformanceTest.TarjanLCARandomForestBenchmark S 118 org.jgrapht.perf.lca.generated.LowestCommonAncestorAlgorithmPerformanceTest_TarjanLCARandomForestBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 133 org.jgrapht.perf.matching.MaximumCardinalityBipartiteMatchingPerformanceTest.HopcroftKarpMaximumCardinalityBipartiteMatchingBenchmark S 155 org.jgrapht.perf.matching.generated.MaximumCardinalityBipartiteMatchingPerformanceTest_HopcroftKarpMaximumCardinalityBipartiteMatchingBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
JMH S 94 org.jgrapht.perf.lca.LowestCommonAncestorAlgorithmPerformanceTest.HeavyPathRandomTreeBenchmark S 116 org.jgrapht.perf.lca.generated.LowestCommonAncestorAlgorithmPerformanceTest_HeavyPathRandomTreeBenchmark_run_jmhTest S 3 run S 10 Throughput E A 1 1 1 E E E E E E E E E E E E E E E E E 
