|
@ -168,4 +168,23 @@ void test_LabyrinthLinks(void){ |
|
|
TEST_ASSERT_EQUAL_INT(1, result); |
|
|
TEST_ASSERT_EQUAL_INT(1, result); |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
void test_LabyrinthVerzweigung(void){ |
|
|
|
|
|
|
|
|
|
|
|
bool result; |
|
|
|
|
|
int input = 1; |
|
|
|
|
|
int hoehe = 5; |
|
|
|
|
|
int breite = 6; |
|
|
|
|
|
lab laby = { |
|
|
|
|
|
{'0', '1', '0', '0', '0', '0'}, |
|
|
|
|
|
{'0', '1', '0', '1', '1', '0'}, |
|
|
|
|
|
{'0', '0', '0', '0', '1', '0'}, |
|
|
|
|
|
{'0', '1', '1', '0', '1', '0'}, |
|
|
|
|
|
{'0', '1', '0', '0', '1', '0'}, |
|
|
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
|
wegsuchen(laby, &result, 0, 0, 4, 5); |
|
|
|
|
|
printlabyrinth(laby, hoehe, breite); |
|
|
|
|
|
TEST_ASSERT_EQUAL_INT(1, result); |
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
#endif // TEST |
|
|
#endif // TEST |