fixed dijkstra memleak
new dijkstra interfaces and abort options refactored all files accordingly enable logging via compile-time defines
This commit is contained in:
@@ -53,7 +53,7 @@ TEST(TestAll, Nav) {
|
||||
const GP& start = g.getNodeFor(GridPoint(500,200,20));
|
||||
const GP& end = g.getNodeFor(GridPoint(1200,200,340));
|
||||
//const GP& end = g.getNodeFor(GridPoint(1300,1300,20));
|
||||
d.build(start, end, tmp);
|
||||
d.build(&start, &end, tmp);
|
||||
|
||||
// add the path's importance to the grid
|
||||
gi.addImportance(g, d.getNode(start), d.getNode(end));
|
||||
|
||||
@@ -31,7 +31,7 @@ TEST(Dijkstra, build) {
|
||||
} tmp(grid);
|
||||
|
||||
Dijkstra<GP> d;
|
||||
d.build(grid[idx5], grid[idx3], tmp);
|
||||
d.build(&grid[idx5], &grid[idx3], tmp, 99999);
|
||||
|
||||
// start node must be "idx5"
|
||||
DijkstraNode<GP>* n = d.getNode(grid[idx5]);
|
||||
@@ -98,7 +98,7 @@ void dijkstra(Grid<GP>& grid) {
|
||||
} tmp(grid);
|
||||
|
||||
Dijkstra<GP> d;
|
||||
d.build(grid[0], grid[0], tmp);
|
||||
d.build(&grid[0], tmp);
|
||||
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user