#include <Graph.h>
| Graph::Graph | ( | ) | [inline] |
| Graph::Graph | ( | uint | num_nodes, |
| uint | num_edges, | ||
| const WayPointNode | nnodes[], | ||
| const WayPointEdge | nedges[] | ||
| ) | [inline] |
| Graph::Graph | ( | Graph & | that | ) | [inline] |
| Graph::~Graph | ( | ) | [inline] |
| void Graph::clear | ( | void | ) |
| bool Graph::compare | ( | const Graph & | that | ) | [inline] |
| WayPointEdgeList Graph::edges_from | ( | const waypt_index_t | index | ) | const |
| WayPointEdgeList Graph::edges_leaving_segment | ( | const segment_id_t | seg | ) | const |
| void Graph::find_implicit_edges | ( | ) |
| void Graph::find_mapxy | ( | void | ) |
| WayPointNode * Graph::get_closest_node | ( | const MapXY & | p | ) | const |
| WayPointNode * Graph::get_closest_node_within_radius | ( | const MapXY & | p | ) | const |
| WayPointNode * Graph::get_node_by_id | ( | const ElementID | id | ) | const |
| WayPointNode * Graph::get_node_by_index | ( | const waypt_index_t | index | ) | const |
| bool Graph::lanes_in_same_direction | ( | int | index1, |
| int | index2, | ||
| bool & | left_lane | ||
| ) |
| bool Graph::load | ( | const char * | fName | ) |
| bool Graph::passing_allowed | ( | int | index, |
| int | index2, | ||
| bool | left | ||
| ) |
| void Graph::printEdges | ( | ) |
| void Graph::printEdgesFile | ( | const char * | fName | ) |
| void Graph::printNodes | ( | ) |
| void Graph::printNodesFile | ( | const char * | fName | ) |
| void Graph::save | ( | const char * | fName | ) |
| void Graph::xy_rndf | ( | ) |
| std::vector<WayPointEdge> Graph::edges |
