| removeNode(Node) |   | 63% | | 50% | 6 | 10 | 7 | 20 | 0 | 1 |
| addEdge(Node, Node, Object) | | 94% | | 50% | 2 | 3 | 1 | 6 | 0 | 1 |
| removeEdge(Node, Node) | | 94% | | 50% | 1 | 2 | 1 | 6 | 0 | 1 |
| removeEdge(Edge) | | 92% | | 50% | 1 | 2 | 1 | 5 | 0 | 1 |
| getStronglyConnectedComponent() | | 100% | | 100% | 0 | 9 | 0 | 30 | 0 | 1 |
| depthFirstSearch(Node, TreeSet, ArrayList) | | 100% | | 100% | 0 | 7 | 0 | 24 | 0 | 1 |
| transitiveClosure() | | 100% | | 100% | 0 | 7 | 0 | 24 | 0 | 1 |
| clone() | | 100% | | 100% | 0 | 3 | 0 | 11 | 0 | 1 |
| depthFirstSearch() | | 100% | | 100% | 0 | 3 | 0 | 14 | 0 | 1 |
| complementary() | | 100% | | 100% | 0 | 4 | 0 | 12 | 0 | 1 |
| getSubgraphByNodes(Set) | | 100% | | 88% | 1 | 5 | 0 | 10 | 0 | 1 |
| getSubgraphByEdges(Set) | | 100% | | 83% | 1 | 4 | 0 | 9 | 0 | 1 |
| ConcreteDGraph(SortedSet) | | 100% | | 100% | 0 | 2 | 0 | 7 | 0 | 1 |
| transpose() | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
| addEdge(Edge) | | 100% | | 75% | 1 | 3 | 0 | 5 | 0 | 1 |
| getEdge(Node, Node) | | 100% | | 50% | 2 | 3 | 0 | 7 | 0 | 1 |
| addNode(Node) | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
| getSuccessorNodes(Node) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| getPredecessorNodes(Node) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| reflexiveReduction() | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| reflexiveClosure() | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| sizeEdges() | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| containsEdge(Node, Node) | | 100% | | 75% | 2 | 5 | 0 | 4 | 0 | 1 |
| ConcreteDGraph(DGraph) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| getNodeByContent(Object) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| removeNodes(Set) | | 100% | | 100% | 0 | 3 | 0 | 6 | 0 | 1 |
| getNode(Node) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| getNodeByIdentifier(int) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| ConcreteDGraph() | | 100% | | n/a | 0 | 1 | 0 | 5 | 0 | 1 |
| getSuccessorEdges(Node) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getPredecessorEdges(Node) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| containsEdge(Edge) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getEdges() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| addEdge(Node, Node) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| containsNode(Node) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| setNodes(TreeSet) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| setSuccessors(TreeMap) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| setPredecessors(TreeMap) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| getNodes() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| sizeNodes() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getSuccessors() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getPredecessors() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |