Classes | |
| class | PossiblePathComparision |
Typedefs | |
| typedef std::priority_queue < PossiblePath, std::vector < PossiblePath > , PossiblePathComparision > | PathPriorityQueue |
| typedef std::pair< std::pair < double, double > , WayPointEdgeList > | PossiblePath |
Functions | |
| void | add_to_queue (const Graph &graph, PathPriorityQueue *q, waypt_index_t from_index, PossiblePath &old_possible_path, const waypt_index_t goal_id, float speedlimit, int prev_start_index) |
| WayPointEdgeList | astar_search (const Graph &graph, waypt_index_t start_id, waypt_index_t goal_id, float speedlimit=1.0) |
| double | cost (const Graph &graph, const WayPointEdge &edge, float speedlimit) |
| WayPointNodeList | edge_list_to_node_list (const Graph &graph, WayPointEdgeList &edges) |
| double | heuristic (const Graph &graph, const waypt_index_t start_id, const waypt_index_t goal_id, float speedlimit) |
| void | print_edge_list (WayPointEdgeList &edges, const Graph &graph) |
| void | print_possible_path (PossiblePath &pp, const Graph &graph) |
| double | time_along_edge (const Graph &graph, const WayPointEdge &edge, float speedlimit) |
| double | time_between_nodes (const WayPointNode &start, const WayPointNode &end, float speedlimit) |
| typedef std::priority_queue<PossiblePath,std::vector<PossiblePath>,PossiblePathComparision> GraphSearch::PathPriorityQueue |
Definition at line 62 of file GraphSearch.cc.
| typedef std::pair<std::pair<double,double>,WayPointEdgeList> GraphSearch::PossiblePath |
Definition at line 39 of file GraphSearch.cc.
| void GraphSearch::add_to_queue | ( | const Graph & | graph, | |
| PathPriorityQueue * | q, | |||
| waypt_index_t | from_index, | |||
| PossiblePath & | old_possible_path, | |||
| const waypt_index_t | goal_id, | |||
| float | speedlimit, | |||
| int | prev_start_index | |||
| ) |
Definition at line 148 of file GraphSearch.cc.
| WayPointEdgeList GraphSearch::astar_search | ( | const Graph & | graph, | |
| waypt_index_t | start_id, | |||
| waypt_index_t | goal_id, | |||
| float | speedlimit = 1.0 | |||
| ) |
Definition at line 207 of file GraphSearch.cc.
| double GraphSearch::cost | ( | const Graph & | graph, | |
| const WayPointEdge & | edge, | |||
| float | speedlimit | |||
| ) |
Definition at line 140 of file GraphSearch.cc.
| WayPointNodeList GraphSearch::edge_list_to_node_list | ( | const Graph & | graph, | |
| WayPointEdgeList & | edges | |||
| ) |
Definition at line 14 of file GraphSearch.cc.
| double GraphSearch::heuristic | ( | const Graph & | graph, | |
| const waypt_index_t | start_id, | |||
| const waypt_index_t | goal_id, | |||
| float | speedlimit | |||
| ) |
Definition at line 124 of file GraphSearch.cc.
| void GraphSearch::print_edge_list | ( | WayPointEdgeList & | edges, | |
| const Graph & | graph | |||
| ) |
Definition at line 41 of file GraphSearch.cc.
| void GraphSearch::print_possible_path | ( | PossiblePath & | pp, | |
| const Graph & | graph | |||
| ) |
Definition at line 49 of file GraphSearch.cc.
| double GraphSearch::time_along_edge | ( | const Graph & | graph, | |
| const WayPointEdge & | edge, | |||
| float | speedlimit | |||
| ) |
Definition at line 86 of file GraphSearch.cc.
| double GraphSearch::time_between_nodes | ( | const WayPointNode & | start, | |
| const WayPointNode & | end, | |||
| float | speedlimit | |||
| ) |
Definition at line 64 of file GraphSearch.cc.
