GraphSimplifier

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total1,712 of 1,7120%218 of 2180%1361363423422727
edgesAreNeighboring(int, int, GraphSimplifier.ProposedSimplificationStep)2530%300%1616444411
applySimplificationStep()1410%120%77292911
connectComponentsThroughJoins(HyperGraph, CircleDetector, long[], int[])1370%220%1212363611
concretizeSimplificationStep(GraphSimplifier.ProposedSimplificationStep)1300%120%77222211
GraphSimplifier(HyperGraph)1150%60%44212111
recalculateNeighbors(int, int, int)1150%180%1010222211
calCost(Edge, long, long)1150%180%1010141411
simplifyGraph(int)960%200%1111333311
combiningWouldViolateConflictRules(List, int[], int, int)740%160%99141411
constructEdge(long, Edge, long)720%20%22181811
extractJoinDependencies(CircleDetector)570%80%55101011
threeLeftJoin(long, Edge, long, Edge, long)560%80%55101011
threeRightJoin(long, Edge, long, Edge, long)560%80%55101011
updatePQ(int)510%80%55111111
graphIsJoinable(HyperGraph, CircleDetector)370%40%337711
deriveStats(Edge, long, long)350%20%228811
getComponent(long[], int[], long)290%60%447711
unApplySimplificationStep()290%20%225511
applyStepsWithNum(int)260%60%447711
tryGetSuperset(long, long, List)240%40%337711
getLastAppliedSteps()200%20%223311
isTotalOrder()190%40%331111
lambda$constructEdge$1(int)70%n/a111111
lambda$constructEdge$0(int)70%n/a111111
numStepsDone()40%n/a111111
numStepsUndone()40%n/a111111
static {...}30%n/a111111