GraphSimplifier

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total1,324 of 1,71222%177 of 21818%1161362623421727
edgesAreNeighboring(int, int, GraphSimplifier.ProposedSimplificationStep)1658834%171343%1216274401
connectComponentsThroughJoins(HyperGraph, CircleDetector, long[], int[])1370%220%1212363611
concretizeSimplificationStep(GraphSimplifier.ProposedSimplificationStep)1300%120%77222211
applySimplificationStep()128139%10216%67252901
calCost(Edge, long, long)1150%180%1010141411
combiningWouldViolateConflictRules(List, int[], int, int)740%160%99141411
constructEdge(long, Edge, long)720%20%22181811
recalculateNeighbors(int, int, int)694640%14422%810132201
simplifyGraph(int)593738%16420%1011233301
threeLeftJoin(long, Edge, long, Edge, long)560%80%55101011
threeRightJoin(long, Edge, long, Edge, long)560%80%55101011
graphIsJoinable(HyperGraph, CircleDetector)370%40%337711
deriveStats(Edge, long, long)350%20%228811
getComponent(long[], int[], long)290%60%447711
unApplySimplificationStep()290%20%225511
updatePQ(int)282345%5337%4561101
applyStepsWithNum(int)260%60%447711
getLastAppliedSteps()200%20%223311
isTotalOrder()190%40%331111
tryGetSuperset(long, long, List)141041%2250%234701
extractJoinDependencies(CircleDetector)84985%1787%1511001
lambda$constructEdge$1(int)70%n/a111111
lambda$constructEdge$0(int)70%n/a111111
numStepsUndone()40%n/a111111
GraphSimplifier(HyperGraph)115100%6100%0402101
numStepsDone()4100%n/a010101
static {...}3100%n/a010101