some fixes [multithreading,..]
needed interface changes [new options] logger for android wifi-ap-optimization new test-cases
This commit is contained in:
@@ -34,15 +34,15 @@ TEST(Dijkstra, build) {
|
||||
d.build(&grid[idx5], &grid[idx3], tmp, 99999);
|
||||
|
||||
// start node must be "idx5"
|
||||
DijkstraNode<GP>* n = d.getNode(grid[idx5]);
|
||||
const DijkstraNode<GP>* n = d.getNode(grid[idx5]);
|
||||
ASSERT_EQ(&grid[idx5], n->element); ASSERT_EQ(nullptr, n->previous); ASSERT_EQ(0, n->cumWeight);
|
||||
|
||||
// "idx1" (the center) is reached via idx5
|
||||
DijkstraNode<GP>* n2 = d.getNode(grid[idx1]);
|
||||
const DijkstraNode<GP>* n2 = d.getNode(grid[idx1]);
|
||||
ASSERT_EQ(&grid[idx1], n2->element); ASSERT_EQ(&grid[idx5], n2->previous->element);
|
||||
|
||||
// "idx3" (the target) is reached via idx1 (the center)
|
||||
DijkstraNode<GP>* n3 = d.getNode(grid[idx3]);
|
||||
const DijkstraNode<GP>* n3 = d.getNode(grid[idx3]);
|
||||
ASSERT_EQ(&grid[idx3], n3->element); ASSERT_EQ(&grid[idx1], n3->previous->element);
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user