| deleteDangles() |  | 0% | | 0% | 6 | 6 | 23 | 23 | 1 | 1 |
| computeNextCCWEdges(Node, long) | | 0% | | 0% | 12 | 12 | 24 | 24 | 1 | 1 |
| addEdge(LineString) | | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| deleteCutEdges() | | 0% | | 0% | 4 | 4 | 14 | 14 | 1 | 1 |
| findIntersectionNodes(PolygonizeDirectedEdge, long) | | 0% | | 0% | 7 | 7 | 12 | 12 | 1 | 1 |
| computeNextCWEdges(Node) | | 0% | | 0% | 6 | 6 | 17 | 17 | 1 | 1 |
| getEdgeRings() | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| findLabeledEdgeRings(Collection) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| convertMaximalToMinimalEdgeRings(List) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| deleteAllEdges(Node) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| getDegree(Node, long) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| getDegreeNonDeleted(Node) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| getNode(Coordinate) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| label(Collection, long) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| computeNextCWEdges() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| findEdgeRing(PolygonizeDirectedEdge) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| PolygonizeGraph(GeometryFactory) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |