Rating | Name | Duplication | Size | Complexity | Changes | Bugs | Features |
---|---|---|---|---|---|---|---|
D | TravelingSalesman\TwoOpt::computeRoute() | 8 | 23 | 9 | 0 | 0 | 0 |
C | TravelingSalesman\ThreeOpt::computeRoute() | 8 | 24 | 12 | 0 | 0 | 0 |
C | FloydWarshall::computeDistanceGraph() | 26 | 24 | 11 | 0 | 0 | 0 |
C | Grid\ASCIISyntax::generateNodePath() | 0 | 26 | 8 | 0 | 0 | 0 |
C | ShortestPath\AStar::computePath() | 0 | 28 | 8 | 0 | 0 | 0 |
C | ShortestPath\Dijkstra::computePath() | 0 | 20 | 7 | 0 | 0 | 0 |
C | ASCIISyntax::convertToSyntaxWithPath() | 0 | 17 | 7 | 0 | 0 | 0 |
C | NearestNeighbour::computeRoute() | 0 | 23 | 7 | 0 | 0 | 0 |
B | TravelingSalesman\ThreeOpt::threeOptSwap() | 0 | 12 | 5 | 0 | 0 | 0 |
B | Dijkstra::computeDistanceGraph() | 0 | 12 | 6 | 0 | 0 | 0 |
B | NodeGrid::getWalkableNeighbors() | 0 | 14 | 4 | 0 | 0 | 0 |
B | Core\NodeGraph::getEdgeBetween() | 4 | 12 | 6 | 0 | 0 | 0 |
B | Core\NodeGraph::existsEdgeBetween() | 4 | 12 | 6 | 0 | 0 | 0 |
B | Core\NodeGraph::createEdgeBetween() | 0 | 10 | 5 | 0 | 0 | 0 |
A | TravelingSalesman\TwoOpt::twoOptSwap() | 0 | 10 | 4 | 0 | 0 | 0 |