Graphs.SynchronizedGraph |  | 0% |  | 0% | 83 | 83 | 291 | 291 | 73 | 73 | 1 | 1 |
AbstractGraph |   | 29% |   | 26% | 107 | 129 | 191 | 270 | 62 | 79 | 0 | 1 |
AbstractElement |   | 4% |   | 1% | 111 | 116 | 185 | 196 | 33 | 38 | 0 | 1 |
Graphs.SynchronizedNode |  | 0% |  | 0% | 47 | 47 | 162 | 162 | 41 | 41 | 1 | 1 |
Graphs.SynchronizedElement |  | 0% |  | 0% | 29 | 29 | 106 | 106 | 28 | 28 | 1 | 1 |
AdjacencyListNode |   | 38% |   | 29% | 29 | 41 | 48 | 88 | 11 | 20 | 0 | 1 |
AbstractGraph.GraphListeners |   | 7% |  | 0% | 36 | 38 | 62 | 68 | 15 | 17 | 0 | 1 |
AbstractNode |   | 4% |  | 0% | 51 | 53 | 39 | 43 | 34 | 36 | 0 | 1 |
OneAttributeElement |  | 0% |  | 0% | 38 | 38 | 47 | 47 | 23 | 23 | 1 | 1 |
AbstractGraph.GraphReplayController |  | 0% |  | 0% | 10 | 10 | 26 | 26 | 3 | 3 | 1 | 1 |
Graphs |  | 0% |  | 0% | 9 | 9 | 27 | 27 | 5 | 5 | 1 | 1 |
AdjacencyListGraph |   | 65% |   | 25% | 12 | 22 | 25 | 66 | 7 | 16 | 0 | 1 |
Graphs.SynchronizedEdge |  | 0% |  | 0% | 9 | 9 | 27 | 27 | 8 | 8 | 1 | 1 |
MultiNode |   | 51% |   | 17% | 14 | 18 | 20 | 38 | 6 | 9 | 0 | 1 |
AbstractEdge |   | 42% |   | 31% | 13 | 22 | 11 | 28 | 6 | 14 | 0 | 1 |
AdjacencyListGraph.EdgeIterator |  | 0% |  | 0% | 7 | 7 | 14 | 14 | 4 | 4 | 1 | 1 |
AbstractNode.new Iterator() {...} |  | 0% |  | 0% | 9 | 9 | 20 | 20 | 5 | 5 | 1 | 1 |
AdjacencyListGraph.NodeIterator |  | 0% |  | 0% | 7 | 7 | 14 | 14 | 4 | 4 | 1 | 1 |
AbstractElement.AttributeChangeEvent |  | 0% | | n/a | 4 | 4 | 3 | 3 | 4 | 4 | 1 | 1 |
OneAttributeElement.AttributeChangeEvent |  | 0% | | n/a | 4 | 4 | 3 | 3 | 4 | 4 | 1 | 1 |
AdjacencyListNode.EdgeIterator |   | 83% |   | 57% | 6 | 11 | 4 | 24 | 0 | 4 | 0 | 1 |
SingleNode |   | 87% |   | 59% | 11 | 17 | 7 | 39 | 2 | 6 | 0 | 1 |
DefaultGraph |  | 0% | | n/a | 3 | 3 | 7 | 7 | 3 | 3 | 1 | 1 |
AbstractGraph.new AbstractCollection() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
AbstractNode.new AbstractCollection() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
AbstractGraph.new AbstractCollection() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
AbstractNode.new AbstractCollection() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
AbstractNode.new AbstractCollection() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
AbstractGraph.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
AbstractNode.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
AbstractNode.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
AbstractNode.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
AbstractGraph.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
AdjacencyListGraph.new NodeFactory() {...} | | 46% | | n/a | 1 | 2 | 1 | 3 | 1 | 2 | 0 | 1 |
MultiGraph |  | 100% | | n/a | 0 | 3 | 0 | 9 | 0 | 3 | 0 | 1 |
SingleGraph |  | 100% | | n/a | 0 | 3 | 0 | 9 | 0 | 3 | 0 | 1 |
AdjacencyListGraph.new EdgeFactory() {...} |  | 100% | | n/a | 0 | 2 | 0 | 4 | 0 | 2 | 0 | 1 |
SingleGraph.new NodeFactory() {...} |  | 100% | | n/a | 0 | 2 | 0 | 3 | 0 | 2 | 0 | 1 |
MultiGraph.new NodeFactory() {...} |  | 100% | | n/a | 0 | 2 | 0 | 3 | 0 | 2 | 0 | 1 |
SingleNode.TwoEdges | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 |