| makeSimplificationStep(int, int) |  | 0% | | 0% | 17 | 17 | 32 | 32 | 1 | 1 |
| calCost(JoinEdge, long, long) | | 0% | | 0% | 7 | 7 | 14 | 14 | 1 | 1 |
| GraphSimplifier(HyperGraph) | | 0% | | 0% | 3 | 3 | 23 | 23 | 1 | 1 |
| isTotalOrder() | | 0% | | 0% | 9 | 9 | 14 | 14 | 1 | 1 |
| simplifyGraph(int) | | 0% | | 0% | 9 | 9 | 24 | 24 | 1 | 1 |
| orderJoin(JoinEdge, JoinEdge, int, int) | | 0% | | 0% | 4 | 4 | 19 | 19 | 1 | 1 |
| processNeighbors(int, int, int) | | 0% | | 0% | 7 | 7 | 14 | 14 | 1 | 1 |
| constructEdge(long, JoinEdge, long) | | 0% | | 0% | 2 | 2 | 18 | 18 | 1 | 1 |
| fetchSimplificationStep() | | 0% | | 0% | 6 | 6 | 16 | 16 | 1 | 1 |
| applySimplificationStep() | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| threeLeftJoin(long, JoinEdge, long, JoinEdge, long) | | 0% | | 0% | 5 | 5 | 10 | 10 | 1 | 1 |
| threeRightJoin(long, JoinEdge, long, JoinEdge, long) | | 0% | | 0% | 5 | 5 | 10 | 10 | 1 | 1 |
| extractJoinDependencies() | | 0% | | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
| lambda$new$0(HyperGraph, JoinEdge) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| updatePriorityQueue(int) | | 0% | | 0% | 4 | 4 | 10 | 10 | 1 | 1 |
| deriveStats(JoinEdge, long, long) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| unApplySimplificationStep() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| isOverlap(Edge, Edge) | | 0% | | 0% | 5 | 5 | 4 | 4 | 1 | 1 |
| trySetSimplificationStep(GraphSimplifier.SimplificationStep, GraphSimplifier.BestSimplification, int, int) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| tryGetSuperset(long, long, List) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| getLastAppliedSteps() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| initFirstStep() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| applyStepsWithNum(int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| lambda$constructEdge$2(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$constructEdge$1(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |