katja/MultilevelAStarExt
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Changed how the closest node is picked.

Browse Source 
Ignoring closed nodes.
This commit is contained in:
Katja
2024-06-05 15:56:14 +02:00
parent 9f3af7b380
commit 7aaf09ec9a
1 changed files with 9 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/MultilevelAStarEx.cpp
View File

@@ -263,12 +263,16 @@ Variant MultilevelAStarEx::find_path(const Vector2i &from, const Vector2i &to, b
auto process = [this, &open, &to2, &closest](Node *current, int x, int y, int distance) { auto process = [this, &open, &to2, &closest](Node *current, int x, int y, int distance) {
Node *node = &NODES(x, y); Node *node = &NODES(x, y);
if (node->state(_pass) == Node::UNUSED) if (node->state(_pass) == Node::UNUSED)
{ {
node->open(_pass, current, current->distanceFromStart + distance, to2); node->open(_pass, current, current->distanceFromStart + distance, to2);
open.push_back(node); open.push_back(node);
} }
// TODO: check if this should only be performed on open nodes or all nodes else if (node->state(_pass) == Node::CLOSED)
{
return;
}
else if (current->distanceFromStart + distance < node->distanceFromStart) else if (current->distanceFromStart + distance < node->distanceFromStart)
{ {
node->parent = current; node->parent = current;
@@ -299,6 +303,10 @@ Variant MultilevelAStarEx::find_path(const Vector2i &from, const Vector2i &to, b
{ {
current = n; current = n;
} }
else if ((n->total_cost() == current->total_cost()) && (n->distanceToEnd < current->distanceToEnd))
{
current = n;
}
} }
if (current->distanceToEnd == 0) if (current->distanceToEnd == 0)