mirror of
https://github.com/ApfelTeeSaft/PlanetFleet.git
synced 2026-08-26 19:33:38 +00:00
80 lines
2.8 KiB
C++
80 lines
2.8 KiB
C++
#include "pathfinderTest.h"
|
|
#include "pathfinder.h"
|
|
|
|
#include <util.h>
|
|
|
|
#include <vector>
|
|
|
|
namespace battleship{
|
|
using namespace std;
|
|
using namespace vb01;
|
|
|
|
vector<Map::Cell> PathfinderTest::generateCellGraph(int numCellsOnSide){
|
|
vector<Map::Cell> cells;
|
|
|
|
for(int i = 0; i < numCellsOnSide; i++)
|
|
for(int j = 0; j < numCellsOnSide; j++){
|
|
vector<Map::Edge> edges = Map::generateAdjacentNodeEdges(numCellsOnSide, i, numCellsOnSide, j, 1);
|
|
cells.push_back(Map::Cell(Vector3::VEC_ZERO, Map::Cell::Type::LAND, edges));
|
|
}
|
|
|
|
return cells;
|
|
}
|
|
|
|
int PathfinderTest::calcPathLength(vector<int> &path){
|
|
int sumPathWeights = 0;
|
|
|
|
for(int i = 0; i < path.size() - 1; i++)
|
|
for(int j = 0; j < cells[path[i]].edges.size(); j++)
|
|
if(cells[path[i]].edges[j].destCellId == path[i + 1])
|
|
sumPathWeights += cells[path[i]].edges[j].weight;
|
|
|
|
return sumPathWeights;
|
|
}
|
|
|
|
void PathfinderTest::testFindPath(){
|
|
cells = vector<Map::Cell>{
|
|
Map::Cell(Vector3::VEC_ZERO, Map::Cell::Type::LAND, vector<Map::Edge>{Map::Edge(0, 0, 0), Map::Edge(2, 0, 1), Map::Edge(4, 0, 2)}),
|
|
Map::Cell(Vector3::VEC_ZERO, Map::Cell::Type::LAND, vector<Map::Edge>{Map::Edge(0, 1, 1), Map::Edge(1, 1, 2), Map::Edge(9, 1, 3), Map::Edge(13, 1, 4)}),
|
|
Map::Cell(Vector3::VEC_ZERO, Map::Cell::Type::LAND, vector<Map::Edge>{Map::Edge(0, 2, 2), Map::Edge(2, 2, 1), Map::Edge(4, 2, 4), Map::Edge(5, 2, 5)}),
|
|
Map::Cell(Vector3::VEC_ZERO, Map::Cell::Type::LAND, vector<Map::Edge>{Map::Edge(0, 3, 3), Map::Edge(1, 3, 6)}),
|
|
Map::Cell(Vector3::VEC_ZERO, Map::Cell::Type::LAND, vector<Map::Edge>{Map::Edge(0, 4, 4), Map::Edge(1, 4, 1), Map::Edge(1, 4, 3), Map::Edge(2, 4, 5), Map::Edge(3, 4, 6)}),
|
|
Map::Cell(Vector3::VEC_ZERO, Map::Cell::Type::LAND, vector<Map::Edge>{Map::Edge(0, 5, 5), Map::Edge(9, 5, 4), Map::Edge(2, 5, 6)}),
|
|
Map::Cell(Vector3::VEC_ZERO, Map::Cell::Type::LAND, vector<Map::Edge>{Map::Edge(0, 6, 6)})
|
|
};
|
|
|
|
const u16 INF = u16(0 - 1);
|
|
pathfinder->setImpassibleNodeVal(INF);
|
|
|
|
vector<int> path = pathfinder->findPath(cells, 0, cells.size() - 1);
|
|
CPPUNIT_ASSERT(path == vector<int>({0, 1, 2, 4, 3, 6}));
|
|
|
|
int sumPathWeights = calcPathLength(path);
|
|
CPPUNIT_ASSERT(sumPathWeights == 9);
|
|
}
|
|
|
|
void PathfinderTest::testFindBigPath(){
|
|
int numIterations = 1;
|
|
cells = generateCellGraph(60);
|
|
s64 sumTime = 0;
|
|
|
|
for(int i = 0; i < numIterations; i++){
|
|
s64 t0 = getTime();
|
|
pathfinder->findPath(cells, 0, cells.size() - 1);
|
|
s64 t1 = getTime();
|
|
sumTime += t1 - t0;
|
|
}
|
|
|
|
int threshold = 100;
|
|
double avg = (double)sumTime / numIterations, eps = .1;
|
|
cout << "Total time: " << sumTime << endl;
|
|
CPPUNIT_ASSERT(sumTime <= threshold);
|
|
}
|
|
|
|
void PathfinderTest::setUp(){
|
|
pathfinder = Pathfinder::getSingleton();
|
|
}
|
|
|
|
void PathfinderTest::tearDown(){}
|
|
}
|