| computeLongestPathLevels(Set, List) |  | 100% | | 100% | 0 | 8 | 0 | 24 | 0 | 1 |
| reset(List, List, Map) | | 100% | | 100% | 0 | 5 | 0 | 20 | 0 | 1 |
| computeLayout(List, Map, Map) | | 100% | | 100% | 0 | 3 | 0 | 19 | 0 | 1 |
| computeTransitiveReductionRemovals(Set, List) | | 100% | | 100% | 0 | 4 | 0 | 16 | 0 | 1 |
| wouldCreateCycle(List, Long, Long) | | 100% | | 100% | 0 | 5 | 0 | 15 | 0 | 1 |
| bfsReachable(Long, Map) | | 100% | | 100% | 0 | 4 | 0 | 10 | 0 | 1 |
| buildAdjacency(List) | | 100% | | 100% | 0 | 2 | 0 | 7 | 0 | 1 |
| computeStronglyConnectedComponents(Map, Set) | | 100% | | 100% | 0 | 3 | 0 | 6 | 0 | 1 |
| lambda$computeTransitiveReductionRemovals$3(Long, Map, Long) | | 100% | | 100% | 0 | 3 | 0 | 1 | 0 | 1 |
| colorForLevel(int) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| reset(List, List) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| lambda$computeLayout$2(Map, Concept) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$computeLayout$1(Map, Concept) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$buildAdjacency$4(Long) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| ConceptGraphService() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$reset$0(Long) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |