#include <Dijkstra.hpp>
|
static void | computeCost (const maps::grid::TraversabilityNodeBase *source, std::unordered_map< const maps::grid::TraversabilityNodeBase *, double > &outDistances, const traversability_generator3d::TraversabilityConfig &config) |
|
◆ computeCost()
void ugv_nav4d::Dijkstra::computeCost |
( |
const maps::grid::TraversabilityNodeBase * |
source, |
|
|
std::unordered_map< const maps::grid::TraversabilityNodeBase *, double > & |
outDistances, |
|
|
const traversability_generator3d::TraversabilityConfig & |
config |
|
) |
| |
|
static |
Computes the heuristic cost from source
to all reachable nodes
- Parameters
-
outDistances | mapping from node to distance |
maxDist | the maximum possible distance |
The documentation for this class was generated from the following files: