diff options
| author | Yuri Sizov <yuris@humnom.net> | 2023-12-19 13:01:45 +0100 |
|---|---|---|
| committer | Yuri Sizov <yuris@humnom.net> | 2023-12-19 13:01:45 +0100 |
| commit | d4806d2d84163351588acb963c2db4078c66ffc2 (patch) | |
| tree | 01d7e547fd9e2375d1243284619d83b2389b6262 /modules/navigation/nav_map.cpp | |
| parent | 13dd72ce78861c32b0a9239a292028614112be97 (diff) | |
| parent | 11e63d244e3da4d65b3975a4baaa4aada6cb0378 (diff) | |
| download | redot-engine-d4806d2d84163351588acb963c2db4078c66ffc2.tar.gz | |
Merge pull request #85253 from sandygk/fix-reachable-polygon-closest-to-end-point
[Navigation] Do not use travel cost for minimum when re-selecting end point
Diffstat (limited to 'modules/navigation/nav_map.cpp')
| -rw-r--r-- | modules/navigation/nav_map.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/modules/navigation/nav_map.cpp b/modules/navigation/nav_map.cpp index 3b875b7fa7..6429513b53 100644 --- a/modules/navigation/nav_map.cpp +++ b/modules/navigation/nav_map.cpp @@ -372,7 +372,7 @@ Vector<Vector3> NavMap::get_path(Vector3 p_origin, Vector3 p_destination, bool p // Stores the further reachable end polygon, in case our goal is not reachable. if (is_reachable) { - real_t d = navigation_polys[least_cost_id].entry.distance_to(p_destination) * navigation_polys[least_cost_id].poly->owner->get_travel_cost(); + real_t d = navigation_polys[least_cost_id].entry.distance_to(p_destination); if (reachable_d > d) { reachable_d = d; reachable_end = navigation_polys[least_cost_id].poly; |