Main Page | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members | File Members | Related Pages

/abstraction/mapAbstraction.cpp File Reference

#include "mapAbstraction.h"
#include "constants.h"

Include dependency graph for mapAbstraction.cpp:

Include dependency graph

Functions

graphgetMapGraph (Map *m)
 getMapGraph(map)

void addMapEdges (Map *m, graph *g, int x, int y)

Variables

const int gEdgeProb = 100
 addMapEdges(map, graph, x, y)

const int gStraightEdgeProb = 100

Function Documentation

void addMapEdges Map m,
graph g,
int  x,
int  y
 

graph* getMapGraph Map m  ) 
 

getMapGraph(map)

Given a map, this function uses the external map interfaces to turn it into a graph, and sets the appropriate node numbers for that map. This function should not be called multiple times on the same map, because the original graph map lose it's association with the map.


Variable Documentation

const int gEdgeProb = 100 [static]
 

addMapEdges(map, graph, x, y)

This is a helper function for getMapGraph that does the work of adding the graph edges. Each edge is only added once, so while the graph has directional edges, we treat them as being bidirectional.

const int gStraightEdgeProb = 100 [static]
 


Generated on Tue Aug 18 03:30:55 2009 for HOG by doxygen 1.3.4