shortest_path.hpp File Reference

Implements shortest path algorithms including Dijkstra's method for 2D array data representation. More...

Go to the source code of this file.

Namespaces
namespace	hmap

Functions
void	hmap::find_path_dijkstra (const Array &z, Vec2< int > ij_start, Vec2< int > ij_end, std::vector< int > &i_path, std::vector< int > &j_path, float elevation_ratio=0.1f, float distance_exponent=2.f, float upward_penalization=1.f, const Array *p_mask_nogo=nullptr)
	Finds the path with the lowest elevation and elevation difference between two points in a 2D array using Dijkstra's algorithm.
void	hmap::find_path_dijkstra (const Array &z, Vec2< int > ij_start, std::vector< Vec2< int > > ij_end_list, std::vector< std::vector< int > > &i_path_list, std::vector< std::vector< int > > &j_path_list, float elevation_ratio=0.1f, float distance_exponent=2.f, float upward_penalization=1.f, const Array *p_mask_nogo=nullptr)

Detailed Description

Implements shortest path algorithms including Dijkstra's method for 2D array data representation.

Author

Otto Link (otto..nosp@m.link.nosp@m..bv@g.nosp@m.mail.nosp@m..com)

Copyright

Copyright (c) 2023