GraphSimplifier

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total113 of 1,78293%41 of 22882%3814218349328
isOverlap(Edge, Edge)280%80%554411
concretizeSimplificationStep(GraphSimplifier.ProposedSimplificationStep)2510580%21083%2722201
getLastAppliedSteps()200%20%223311
calCost(Edge, long, long)1414991%71365%61111801
simplifyGraph(int)59194%31785%31123301
constructEdge(long, Edge, long)46894%1150%1211801
numStepsUndone()40%n/a111111
connectComponentsThroughJoins(HyperGraph, CircleDetector, long[], int[])313497%22090%21223601
combiningWouldViolateConflictRules(List, int[], int, int)7297%11593%1911401
getComponent(long[], int[], long)2793%2466%241701
threeLeftJoin(long, Edge, long, Edge, long)5598%3562%3501001
threeRightJoin(long, Edge, long, Edge, long)5598%3562%3501001
updatePQ(int)4497%1787%1501001
unApplySimplificationStep()2896%1150%120501
applyStepsWithNum(int)2596%1583%140701
isTotalOrder()1894%2250%230101
edgesAreNeighboring(int, int, GraphSimplifier.ProposedSimplificationStep)253100%22893%21604401
applySimplificationStep()141100%12100%0702901
GraphSimplifier(HyperGraph)115100%6100%0402101
recalculateNeighbors(int, int, int)115100%18100%01002201
extractJoinDependencies(CircleDetector)57100%8100%0501001
graphIsJoinable(HyperGraph, CircleDetector)37100%4100%030701
deriveStats(Edge, long, long)35100%2100%020801
tryGetSuperset(long, long, List)24100%4100%030701
lambda$constructEdge$1(int)7100%n/a010101
lambda$constructEdge$0(int)7100%n/a010101
numStepsDone()4100%n/a010101
static {...}3100%n/a010101