Rating | Name | Duplication | Size | Complexity | Changes | Bugs | Features |
---|---|---|---|---|---|---|---|
A | AdaptedEnvironment::positionOf() | 0 | 10 | 4 | 0 | 0 | 0 |
A | AdaptedNetwork::movementCostBetween() | 0 | 9 | 4 | 0 | 0 | 0 |
A | AdaptedEnvironment::movementCostBetween() | 0 | 9 | 4 | 0 | 0 | 0 |
A | GraphpFinder\AdaptedNetwork::areNeighbours() | 0 | 8 | 4 | 0 | 0 | 0 |
A | GraphpFinder\AdaptedEnvironment::from() | 0 | 1 | 1 | 0 | 0 | 0 |
A | AdaptedNetwork::hasNegativeEdgeCosts() | 0 | 4 | 3 | 0 | 0 | 0 |
A | GraphpFinder\AdaptedNetwork::all() | 0 | 1 | 1 | 0 | 0 | 0 |
A | AdaptedEnvironment::areNeighbours() | 0 | 8 | 4 | 0 | 0 | 0 |
A | AdaptedEnvironment::hasNegativeEdgeCosts() | 0 | 4 | 3 | 0 | 0 | 0 |
A | GraphpFinder\AdaptedNetwork::has() | 0 | 1 | 1 | 0 | 0 | 0 |
A | AdaptedEnvironment::__construct() | 0 | 2 | 1 | 0 | 0 | 0 |
A | GraphpFinder\AdaptedEnvironment::has() | 0 | 1 | 1 | 0 | 0 | 0 |
A | GraphpFinder\AdaptedNetwork::from() | 0 | 1 | 1 | 0 | 0 | 0 |
A | GraphpFinder\AdaptedEnvironment::from3D() | 0 | 1 | 1 | 0 | 0 | 0 |
A | GraphpFinder\AdaptedNetwork::__construct() | 0 | 1 | 1 | 0 | 0 | 0 |