| search(List, DancingLinks.SolutionAcceptor) |  | 0% | | 0% | 7 | 7 | 29 | 29 | 1 | 1 |
| searchPrefixes(int, int[], List) | | 0% | | 0% | 6 | 6 | 23 | 23 | 1 | 1 |
| addRow(boolean[]) | | 0% | | 0% | 4 | 4 | 20 | 20 | 1 | 1 |
| coverColumn(DancingLinks.ColumnHeader) | | 0% | | 0% | 3 | 3 | 14 | 14 | 1 | 1 |
| uncoverColumn(DancingLinks.ColumnHeader) | | 0% | | 0% | 3 | 3 | 14 | 14 | 1 | 1 |
| addColumn(Object, boolean) | | 0% | | 0% | 2 | 2 | 14 | 14 | 1 | 1 |
| advance(int) | | 0% | | 0% | 5 | 5 | 15 | 15 | 1 | 1 |
| solve(int[], DancingLinks.SolutionAcceptor) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| DancingLinks() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| findBestColumn() | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| getRowName(DancingLinks.Node) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| rollback(DancingLinks.Node) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| split(int) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getColumnName(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| solve(DancingLinks.SolutionAcceptor) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| addColumn(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getNumberColumns() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |