Public Member Functions | Public Attributes
Graph Class Reference

#include <Graph.h>

List of all members.

Public Member Functions

void clear ()
bool compare (const Graph &that)
WayPointEdgeList edges_from (const waypt_index_t index) const
WayPointEdgeList edges_leaving_segment (const segment_id_t seg) const
void find_implicit_edges ()
void find_mapxy (void)
WayPointNodeget_closest_node (const MapXY &p) const
WayPointNodeget_closest_node_within_radius (const MapXY &p) const
WayPointNodeget_node_by_id (const ElementID id) const
WayPointNodeget_node_by_index (const waypt_index_t index) const
 Graph ()
 Graph (uint num_nodes, uint num_edges, const WayPointNode nnodes[], const WayPointEdge nedges[])
 Graph (Graph &that)
bool lanes_in_same_direction (int index1, int index2, bool &left_lane)
bool load (const char *fName)
bool passing_allowed (int index, int index2, bool left)
void printEdges ()
void printEdgesFile (const char *fName)
void printNodes ()
void printNodesFile (const char *fName)
bool rndf_is_gps ()
void save (const char *fName)
void xy_rndf ()
 ~Graph ()

Public Attributes

std::vector< WayPointEdgeedges
uint32_t edges_size
WayPointNodenodes
uint32_t nodes_size

Detailed Description

Definition at line 36 of file Graph.h.


Constructor & Destructor Documentation

Graph::Graph ( ) [inline]

Definition at line 38 of file Graph.h.

Graph::Graph ( uint  num_nodes,
uint  num_edges,
const WayPointNode  nnodes[],
const WayPointEdge  nedges[] 
) [inline]

Definition at line 45 of file Graph.h.

Graph::Graph ( Graph that) [inline]

Definition at line 59 of file Graph.h.

Graph::~Graph ( ) [inline]

Definition at line 70 of file Graph.h.


Member Function Documentation

void Graph::clear ( )

Definition at line 238 of file Graph.cc.

bool Graph::compare ( const Graph that) [inline]

Definition at line 78 of file Graph.h.

Definition at line 13 of file Graph.cc.

Definition at line 22 of file Graph.cc.

Definition at line 551 of file Graph.cc.

void Graph::find_mapxy ( void  )

Fill in MapXY coordinates for map graph.

This method uses the latitude and longitude of the first way-point in the graph, generating its corresponding MapXY coordinates relative to the 10km UTM grid. Then, all the other way-points are relocated relative to that same grid origin.

Definition at line 357 of file Graph.cc.

WayPointNode * Graph::get_closest_node ( const MapXY p) const

Definition at line 46 of file Graph.cc.

Definition at line 60 of file Graph.cc.

Definition at line 38 of file Graph.cc.

Definition at line 31 of file Graph.cc.

bool Graph::lanes_in_same_direction ( int  index1,
int  index2,
bool left_lane 
)

Definition at line 474 of file Graph.cc.

bool Graph::load ( const char *  fName)

Definition at line 163 of file Graph.cc.

bool Graph::passing_allowed ( int  index,
int  index2,
bool  left 
)

Definition at line 399 of file Graph.cc.

Definition at line 264 of file Graph.cc.

void Graph::printEdgesFile ( const char *  fName)

Definition at line 296 of file Graph.cc.

Definition at line 248 of file Graph.cc.

void Graph::printNodesFile ( const char *  fName)

Definition at line 277 of file Graph.cc.

Definition at line 309 of file Graph.cc.

void Graph::save ( const char *  fName)

Definition at line 116 of file Graph.cc.

void Graph::xy_rndf ( )

Definition at line 336 of file Graph.cc.


Member Data Documentation

std::vector<WayPointEdge> Graph::edges

Definition at line 127 of file Graph.h.

Definition at line 129 of file Graph.h.

Definition at line 126 of file Graph.h.

Definition at line 128 of file Graph.h.


The documentation for this class was generated from the following files:


art_map
Author(s): David Li, Patrick Beeson, Bartley Gillen, Tarun Nimmagadda, Mickey Ristroph, Michael Quinlan, Jack O'Quin
autogenerated on Fri Jan 3 2014 11:08:34