summaryrefslogtreecommitdiff
path: root/modules/navigation
diff options
context:
space:
mode:
authorPawel Lampe <pawel.lampe@gmail.com>2022-04-22 18:23:49 +0200
committerPawel Lampe <pawel.lampe@gmail.com>2022-04-22 18:49:45 +0200
commit66856d5fb0b215a902a5dbf35091c56cc63fca1d (patch)
treec2b835c27a07334e78ecd7684e3ec53f54d1ab29 /modules/navigation
parentf4b0c7a1ea8d86c1dfd96478ca12ad1360903d9d (diff)
Fix crash in `GodotNavigationServer::map_get_path`
Diffstat (limited to 'modules/navigation')
-rw-r--r--modules/navigation/nav_map.cpp6
1 files changed, 3 insertions, 3 deletions
diff --git a/modules/navigation/nav_map.cpp b/modules/navigation/nav_map.cpp
index 217e503d82..a6df6bb72c 100644
--- a/modules/navigation/nav_map.cpp
+++ b/modules/navigation/nav_map.cpp
@@ -142,10 +142,10 @@ Vector<Vector3> NavMap::get_path(Vector3 p_origin, Vector3 p_destination, bool p
bool is_reachable = true;
while (true) {
- gd::NavigationPoly *least_cost_poly = &navigation_polys[least_cost_id];
-
// Takes the current least_cost_poly neighbors (iterating over its edges) and compute the traveled_distance.
- for (size_t i = 0; i < least_cost_poly->poly->edges.size(); i++) {
+ for (size_t i = 0; i < navigation_polys[least_cost_id].poly->edges.size(); i++) {
+ gd::NavigationPoly *least_cost_poly = &navigation_polys[least_cost_id];
+
const gd::Edge &edge = least_cost_poly->poly->edges[i];
// Iterate over connections in this edge, then compute the new optimized travel distance assigned to this polygon.