void path_check2(){
printf("Testing FindPath(...) on World2\n");
int i, j;
Grid *g;
g = ReadWorld("world2.txt");
Search *s;
s = FindPath(g);
assert_i(s->Length, -1, "Shortest path length - World2");
assert_i(stack_size(s->s), s->Length+1, "Stack size - World2");
int actual[14][17] = {{5000, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT},
{5000, 10, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, MAX_INT, MAX_INT, MAX_INT},
{5000, 9, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, MAX_INT, MAX_INT, MAX_INT},
{5000, 8, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, MAX_INT},
{5000, 7, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, MAX_INT},
{5000, 6, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, MAX_INT},
{5000, 5, 4, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, 16, 17, MAX_INT},
{5000, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, MAX_INT, 17, 18, MAX_INT},
{5000, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, MAX_INT, 18, 19, MAX_INT},
{5000, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, MAX_INT, 19, 20, MAX_INT},
{5000, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT}};
int correct_dist = 1;
// Compare Calculated Distances to Model Solution.
for(i = 0; i < g->rows; i++){
for(j = 0; j < g->cols; j++){
if(actual[i][j] != s->Distance[i][j]){
correct_dist = 0;
}
}
}
assert_i(correct_dist, 1, "Distance Array - World2");
}
static bool LoadMesh5013(MZFile& file, EluMesh &mesh)
{
V(ReadName(file, mesh));
V(file.Seek(4));
V(SkipVector<char>(file));
V(ReadWorld(file, mesh));
V(file.Seek(16));
VertexData vertexData;
V(ReadVertexData(file, mesh, vertexData, { Pos, Tex, SkipVecV3, Nor, Tan, SkipVecV3 }));
V(ReadIndices(file));
V(ReadBisomething(file));
std::vector<std::array<u16, 6>> subindices;
V(ReadSubindices(file, subindices));
V(LoadSubmeshData(file, mesh));
V(ReadMeshData(file, mesh, subindices, vertexData));
V(file.Seek(2 * sizeof(v3)));
return true;
}
void path_check1(){
printf("Testing FindPath(...) on World1\n");
Grid *g;
g = ReadWorld("world1.txt");
Search *s;
s = FindPath(g);
assert_i(s->Length, 20, "Shortest path length - World1");
assert_i(stack_size(s->s), s->Length+1, "Stack size - World1");
int currR, currC;
int last_currR, last_currC;
int continuous = 1;
int diffR, diffC;
stack_pop(s->s, &last_currR, &last_currC);
assert_i(last_currR, 10, "Start Location (Row) - World1");
assert_i(last_currC, 4, "Start Location (Col) - World1");
g->data[last_currR][last_currC] = '*';
while(stack_size(s->s) > 0){
stack_pop(s->s, &currR, &currC);
g->data[currR][currC] = '*';
diffR = currR - last_currR;
diffR *= diffR;
diffC = currC - last_currC;
diffC *= diffC;
// XOR - Eith diffR or diffC should be 1, not both.
if(!(!diffR != !diffC)){
continuous = 0;
}
last_currR = currR;
last_currC = currC;
}
assert_i(currR, 3, "Path Ends on Goal (Row) - World1");
assert_i(currC, 13, "Path Ends on Goal (Col) - World1");
assert_i(continuous, 1, "Continuous Path from source");
int actual[14][17] = {{MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT},
{MAX_INT, 12, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,MAX_INT},
{MAX_INT, 11, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,MAX_INT},
{MAX_INT, 10, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,MAX_INT},
{MAX_INT, 9, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21,MAX_INT},
{MAX_INT, 8, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,MAX_INT},
{MAX_INT, 7, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,MAX_INT},
{MAX_INT, 6, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,MAX_INT},
{MAX_INT, 5, 4,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT, 14, 15, 16, 17,MAX_INT},
{MAX_INT, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7,MAX_INT, 13, 14, 15, 16,MAX_INT},
{MAX_INT, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6,MAX_INT, 12, 13, 14, 15,MAX_INT},
{MAX_INT, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7,MAX_INT, 11, 12, 13, 14,MAX_INT},
{MAX_INT, 5, 4, 3, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,MAX_INT},
{MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT,MAX_INT}};
int correct_dist = 1, i,j;
// Compare Calculated Distances to Model Solution. We only check for the distances less than the path length (you can stop calculating distances when you find the goal).
for(i = 0; i < 14; i++){
for(j = 0; j < 17; j++){
if(actual[i][j] < 20 && actual[i][j] != s->Distance[i][j]){
correct_dist = 0;
}
}
}
assert_i(correct_dist, 1, "Distance Array - World1");
printf("Path (Not Marked):\n");
for(i = 0; i < 14; i++){
for(j = 0; j < 17; j++){
printf("%c", g->data[i][j]);
}
printf("\n");
}
}
void read_check(){
printf("Testing ReadWorld(...) World1\n");
Grid *g;
g = ReadWorld("world1.txt");
assert_i(g->rows, 14, "ReadWorld - Rows");
assert_i(g->cols, 17, "ReadWorld - Cols");
char actual[14][17]={"-----------------",
"| |",
"| |",
"| G |",
"| |",
"| |",
"| |",
"| |",
"| xxxxxxxxx |",
"| x |",
"| S x |",
"| x |",
"| |",
"-----------------"};
int i,j;
int correct = 1;
for(i = 0; i < g->rows; i++){
for(j = 0; j < g->cols; j++){
if(g->data[i][j] != actual[i][j])
correct = 0;
}
}
counter++;
if(correct){
printf("%4d - Correct - World1 Content\n", counter);
}else{
printf("%4d - Wrong - World1 Content\n", counter);
}
for(i = 0; i < g->rows; i++){
free(g->data[i]);
}
free(g->data);
free(g);
printf("Testing ReadWorld(...) World2\n");
g = ReadWorld("world2.txt");
assert_i(g->rows, 11, "ReadWorld - Rows");
assert_i(g->cols, 15, "ReadWorld - Cols");
char actual2[14][17]={"---------------",
"| xG|",
"| xx|",
"| |",
"| |",
"| |",
"| xxxxxxxxx |",
"| x |",
"| S x |",
"| x |",
"---------------"};
correct = 1;
for(i = 0; i < g->rows; i++){
for(j = 0; j < g->cols; j++){
if(g->data[i][j] != actual2[i][j])
correct = 0;
}
}
counter++;
if(correct){
printf("%4d - Correct - World2 Content\n", counter);
}else{
printf("%4d - Wrong - World2 Content\n", counter);
}
}
