devZoGok/PlanetFleet
1
0
Fork 0
mirror of https://github.com/devZoGok/PlanetFleet.git synced 2026-08-26 19:43:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

implemented Djikstra algorithm

Browse Source
This commit is contained in:
devZoGok
2022-08-06 17:59:44 +03:00
parent a4da044b10
commit ce36d9a00c
3 changed files with 61 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files
pathfinderTest.cpp
+16 -13
View File
@@ -1,38 +1,41 @@
#include "pathfinderTest.h"
#include "pathfinder.h"
#include <util.h>
#include <vector>
namespace battleship{
using namespace std;
using namespace vb01;
void PathfinderTest::testFindPath(){
int size = 7;
int w[size][size] = {
{0, 2, 4, -1, -1, -1, -1},
{-1, 0, 1, 9, 13, -1, -1},
{-1, 2, 0, -1, 4, 5, -1},
{-1, -1, -1, 0, -1, -1, 1},
{1, -1, -1, 1, 0, -1, 3},
{-1, -1, -1, -1, 9, 0, 2},
{-1, -1, -1, -1, -1, -1, 0}
s32 w[size][size] = {
{0, 2, 4, 999, 999, 999, 999},
{999, 0, 1, 9, 13, 999, 999},
{999, 2, 0, 999, 4, 5, 999},
{999, 999, 999, 0, 999, 999, 1},
{1, 999, 999, 1, 0, 999, 3},
{999, 999, 999, 999, 9, 0, 2},
{999, 999, 999, 999, 999, 999, 0}
};
int **weights = new int*[size];
s32 **weights = new s32*[size];
for(int i = 0; i < size; i++){
weights[i] = new int[size];
weights[i] = new s32[size];
for(int j = 0; j < size; j++)
weights[i][j] = w[i][j];
}
vector<int> path = pathfinder->findPath(weights, size, 0, size - 1);
CPPUNIT_ASSERT(path.size() == 6);
CPPUNIT_ASSERT(path == vector<int>({0, 1, 2, 4, 3, 6}));
int sumPathWeights = 0;
for(int p : path)
sumPathWeights += p;
for(int i = 1; i < size; i++)
sumPathWeights += w[path[i - 1]][path[i]];
CPPUNIT_ASSERT(sumPathWeights == 9);
}