| calcLowerBoundMappingCost(Vertex, Vertex, Mapping, Map, Map) |  | 0% | | 0% | 29 | 29 | 75 | 75 | 1 | 1 |
| addChildToQueue(int, DiffImpl.MappingEntry, PriorityQueue, DiffImpl.OptimalEdit, List, List) | | 0% | | 0% | 8 | 8 | 43 | 43 | 1 | 1 |
| diffImpl(Mapping, List, List, AtomicInteger) | | 0% | | 0% | 6 | 6 | 22 | 22 | 1 | 1 |
| calculateRestOfChildren(List, HungarianAlgorithm, double[][], double, Mapping, Vertex, int, int, LinkedBlockingQueue) | | 0% | | 0% | 4 | 4 | 16 | 16 | 1 | 1 |
| expandMappingAndUpdateOptimalMapping(int, int, DiffImpl.OptimalEdit, List, Mapping, int[], List, double) | | 0% | | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
| calcLowerBoundMappingCostForIsolated(Vertex, Mapping, boolean) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| addSiblingToQueue(int, int, PriorityQueue, DiffImpl.OptimalEdit, List, List, DiffImpl.MappingEntry) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| getCostMatrixSum(double[][], int[]) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| DiffImpl(PossibleMappingsCalculator, SchemaGraph, SchemaGraph, PossibleMappingsCalculator.PossibleMappings, SchemaDiffingRunningCheck) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| lambda$diffImpl$0(DiffImpl.MappingEntry, DiffImpl.MappingEntry) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| updateOptimalEdit(DiffImpl.OptimalEdit, int, Mapping) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |