Rating | Name | Duplication | Size | Complexity | CRAP | Changes | Bugs | Features |
---|---|---|---|---|---|---|---|---|
D | Graphp\Path\GraphWalk::verify() | 0 | 66 | 25 | 99.34 | 0 | 0 | 0 |
B | Graphp\Path\GraphWalk::reverse() | 0 | 45 | 11 | 14.59 | 0 | 0 | 0 |
B | Graphp\Path\GraphWalk::equals() | 0 | 13 | 9 | 11.36 | 0 | 0 | 0 |
B | TreeSingleSourcePaths::getPath() | 0 | 21 | 8 | 8.01 | 0 | 0 | 0 |
B | Builder\GraphTypeBuilder::__construct() | 0 | 26 | 8 | 8 | 0 | 0 | 0 |
B | Graphp\Path\GraphWalk::__construct() | 0 | 17 | 8 | 8.13 | 0 | 0 | 0 |
A | Shortestpath\DijkstraShortestPath::getPath() | 0 | 12 | 6 | 6.13 | 1 | 0 | 0 |
A | Graph\AbstractGraph::removeAllEdges() | 0 | 14 | 6 | 6 | 0 | 0 | 0 |
A | Graphp\Graph\AbstractGraph::addEdge() | 0 | 11 | 6 | 6.17 | 0 | 0 | 0 |
A | DirectedSpecifics::getAllEdges() | 0 | 10 | 6 | 6 | 0 | 0 | 0 |
A | Graphp\Path\GraphWalk::concat() | 0 | 20 | 5 | 5 | 0 | 0 | 0 |
A | AbstractGraphPath::getVertexList() | 0 | 14 | 5 | 5.47 | 0 | 0 | 0 |
A | Specifics\DirectedSpecifics::getEdge() | 0 | 9 | 5 | 5 | 0 | 0 | 0 |
A | GraphUtils::removeVertexAndPreserveConnectivity() | 0 | 11 | 5 | 5.01 | 0 | 0 | 0 |
A | Graph\AbstractGraph::removeEdge() | 0 | 11 | 5 | 5.01 | 0 | 0 | 0 |