diff options
| author | Sandy Gutierrez <sandygk@gmail.com> | 2023-11-22 19:36:18 -0500 |
|---|---|---|
| committer | Sandy Gutierrez <sandygk@gmail.com> | 2023-11-28 07:23:58 -0500 |
| commit | 11e63d244e3da4d65b3975a4baaa4aada6cb0378 (patch) | |
| tree | 80e9735cc1357800affdbe223037ba782a8c7c0a /modules/navigation/nav_map.cpp | |
| parent | fa4a65387ea41506ecc519fc61a06da110dce51c (diff) | |
| download | redot-engine-11e63d244e3da4d65b3975a4baaa4aada6cb0378.tar.gz | |
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 ca1034dcc0..7488905eb1 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; |