Rating | Name | Duplication | Size | Complexity | CRAP | Changes | Bugs | Features |
---|---|---|---|---|---|---|---|---|
C | drawLine() | 0 | 14 | 12 | ? | 1 | 0 | 0 |
B | findFromTo() | 0 | 10 | 8 | ? | 1 | 0 | 0 |
B | drawPaths() | 0 | 24 | 7 | ? | 1 | 0 | 0 |
A | Bmichotte\Dijkstra\Dijkstra::getPath() | 0 | 15 | 6 | 6 | 1 | 0 | 0 |
A | Dijkstra\Dijkstra::findNextParent() | 0 | 9 | 6 | 6 | 1 | 0 | 0 |
A | findLinkBetween() | 0 | 8 | 5 | ? | 1 | 0 | 0 |
A | Dijkstra\Dijkstra::findShortestPath() | 0 | 16 | 3 | 3 | 1 | 0 | 0 |
A | Dijkstra\Dijkstra::__construct() | 0 | 3 | 1 | 1 | 1 | 0 | 0 |
A | Bmichotte\Dijkstra\Point::__construct() | 0 | 4 | 1 | 1 | 1 | 0 | 0 |
A | Bmichotte\Dijkstra\Point::addPoint() | 0 | 5 | 3 | 3 | 1 | 0 | 0 |
A | findLink() | 0 | 2 | 2 | ? | 1 | 0 | 0 |
A | Bmichotte\Dijkstra\Point::equals() | 0 | 1 | 1 | 1 | 1 | 0 | 0 |
A | Bmichotte\Dijkstra\Dijkstra::run() | 0 | 6 | 3 | 3 | 2 | 0 | 0 |
A | Dijkstra\Dijkstra::calculateWeight() | 0 | 5 | 4 | 4 | 2 | 0 | 0 |
A | Bmichotte\Dijkstra\Dijkstra::distance() | 0 | 1 | 1 | 1 | 1 | 0 | 0 |