| isTotalOrder() |  | 0% | | 0% | 9 | 9 | 14 | 14 | 1 | 1 |
| fetchSimplificationStep() |  | 50% | | 40% | 5 | 6 | 8 | 16 | 0 | 1 |
| isOverlap(Edge, Edge) | | 0% | | 0% | 5 | 5 | 4 | 4 | 1 | 1 |
| getLastAppliedSteps() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| extractJoinDependencies() | | 66% | | 75% | 2 | 5 | 2 | 9 | 0 | 1 |
| simplifyGraph(int) | | 82% | | 56% | 6 | 9 | 4 | 24 | 0 | 1 |
| makeSimplificationStep(int, int) | | 98% | | 68% | 10 | 17 | 2 | 32 | 0 | 1 |
| constructEdge(long, JoinEdge, long) | | 94% | | 50% | 1 | 2 | 1 | 18 | 0 | 1 |
| updatePriorityQueue(int) | | 90% | | 66% | 2 | 4 | 1 | 10 | 0 | 1 |
| applyStepsWithNum(int) | | 78% | | 75% | 1 | 3 | 1 | 5 | 0 | 1 |
| applySimplificationStep() | | 94% | | 50% | 4 | 5 | 1 | 11 | 0 | 1 |
| threeLeftJoin(long, JoinEdge, long, JoinEdge, long) | | 94% | | 50% | 4 | 5 | 1 | 10 | 0 | 1 |
| threeRightJoin(long, JoinEdge, long, JoinEdge, long) | | 94% | | 50% | 4 | 5 | 1 | 10 | 0 | 1 |
| lambda$new$0(HyperGraph, JoinEdge) | | 95% | | 75% | 2 | 5 | 1 | 11 | 0 | 1 |
| calCost(JoinEdge, long, long) | | 99% | | 75% | 3 | 7 | 0 | 14 | 0 | 1 |
| unApplySimplificationStep() | | 96% | | 50% | 1 | 2 | 0 | 5 | 0 | 1 |
| GraphSimplifier(HyperGraph) | | 100% | | 100% | 0 | 3 | 0 | 23 | 0 | 1 |
| orderJoin(JoinEdge, JoinEdge, int, int) | | 100% | | 66% | 2 | 4 | 0 | 19 | 0 | 1 |
| processNeighbors(int, int, int) | | 100% | | 100% | 0 | 7 | 0 | 14 | 0 | 1 |
| deriveStats(JoinEdge, long, long) | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
| trySetSimplificationStep(GraphSimplifier.SimplificationStep, GraphSimplifier.BestSimplification, int, int) | | 100% | | 83% | 1 | 4 | 0 | 7 | 0 | 1 |
| tryGetSuperset(long, long, List) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| initFirstStep() | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| lambda$constructEdge$2(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$constructEdge$1(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |