| convert(DirectedGraph, Object, Map, Map) |  | 0% | | 0% | 4 | 4 | 29 | 29 | 1 | 1 |
| iconvert(DirectedGraph, Object, boolean) | | 0% | | 0% | 6 | 6 | 22 | 22 | 1 | 1 |
| printTree(Object, Tree, int) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| convertq(DirectedGraph, Collection) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| convert(DirectedGraph, Collection) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| printForest(Forest) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| convertq(DirectedGraph, Object) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| convert(DirectedGraph, Collection, GraphToTreeConverter.Search) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| convertq(DirectedGraph, Collection, GraphToTreeConverter.Search) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| GraphToTreeConverter(GraphToTreeConverter.Search) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| convert(DirectedGraph, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| printTree(Tree) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| GraphToTreeConverter() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |