Classes | Namespaces | Defines
dijkstra.h File Reference
#include <math.h>
#include <stdint.h>
#include <string.h>
#include <stdio.h>
#include <global_planner/planner_core.h>
#include <global_planner/expander.h>
Include dependency graph for dijkstra.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  global_planner::DijkstraExpansion

Namespaces

namespace  global_planner

Defines

#define PRIORITYBUFSIZE   10000
#define push_cur(n)   { if (n>=0 && n<ns_ && !pending_[n] && getCost(costs, n)<lethal_cost_ && currentEnd_<PRIORITYBUFSIZE){ currentBuffer_[currentEnd_++]=n; pending_[n]=true; }}
#define push_next(n)   { if (n>=0 && n<ns_ && !pending_[n] && getCost(costs, n)<lethal_cost_ && nextEnd_<PRIORITYBUFSIZE){ nextBuffer_[ nextEnd_++]=n; pending_[n]=true; }}
#define push_over(n)   { if (n>=0 && n<ns_ && !pending_[n] && getCost(costs, n)<lethal_cost_ && overEnd_<PRIORITYBUFSIZE){ overBuffer_[ overEnd_++]=n; pending_[n]=true; }}

Define Documentation

#define PRIORITYBUFSIZE   10000

Definition at line 41 of file dijkstra.h.

#define push_cur (   n)    { if (n>=0 && n<ns_ && !pending_[n] && getCost(costs, n)<lethal_cost_ && currentEnd_<PRIORITYBUFSIZE){ currentBuffer_[currentEnd_++]=n; pending_[n]=true; }}

Definition at line 51 of file dijkstra.h.

#define push_next (   n)    { if (n>=0 && n<ns_ && !pending_[n] && getCost(costs, n)<lethal_cost_ && nextEnd_<PRIORITYBUFSIZE){ nextBuffer_[ nextEnd_++]=n; pending_[n]=true; }}

Definition at line 52 of file dijkstra.h.

#define push_over (   n)    { if (n>=0 && n<ns_ && !pending_[n] && getCost(costs, n)<lethal_cost_ && overEnd_<PRIORITYBUFSIZE){ overBuffer_[ overEnd_++]=n; pending_[n]=true; }}

Definition at line 53 of file dijkstra.h.



global_planner
Author(s): David Lu!!
autogenerated on Sun Mar 3 2019 03:46:53