| AIStreetSeg | A custom data structure designed to hold a street segment and the segment's parent. Needed to construct the final linked list of intersections |
| CGI_Interface | Please see CGI_Interface2 for further information |
| CGI_Interface2 | Class facilitates input/output through CGI |
| DBInterface | This class is the gateway to all the data held in the database, be it ranking info or map info |
| Encode | Class for base manipulation for speed purposes |
| intersection | Struct designed to hold information about an intersection as it pertains to a full path: its x and y locations and the next intersection as defined by isect_t |
| MapGenerator | Class that activates the MapGeneration process through the use of RouteMaker and the database |
| MapVisuals | This class is the core of the mapVisuals for BikeQuest. The first method defined will only be used once, and it will be offline. Once all the mapTile gifs have been created, the webGUI will be able to call the other two methods to access both a visual and textual description of the user's requested route |
| Parser | The Parser is used to parse geographical data supplied by RIGIS into the BikeQuest database. Other program components then use that data to search for and display bike routes |
| pathDesc | Singly Linked List implementation that describes a path, will mainly be used by AI. Nodes are streetsegs, links are isects |
| PathSearchAI | This class provides the functionality necessary to find an optimal path from A to B. The types of data being passed around are basically set: streetSeg and userPrefs are structs that will be defined elsewhere in our project |
| routeFindData | Struct to send strings for routeFindClient |
| RouteMaker | Class responsible for using existing MapTiles to draw a bike route that has been found by the AI path search algorithm. Graphics done using the gui package Qt |
| routeSearchData | Struct to send data for routeSearchClient |
| SearchParser | The SearchParser acts as an interface between the web front end, the ai search algorithm and the database. It takes in a formatted address, checks to see if it exists and returns the information the database returns, properly formatted. It takes in seg_t's (streets) and calls the AI to find the route between them. It then formates the returned data and returns it |
| SearchParser::StreetAddress | Struct design to hold information regarding a street address in the database, including its name and number |
| segComponents | Struct designed to contain pertinent information regarding segments: ending points, name, and road type |
| streetSeg | Basic building block of BQ. These are the road section descriptors that are easily culled from GIS data. Any modifications to this after 3.15.2005 will be *adds* ... data such as traffic and elevation are possibilities for addition. Struct will be finalized when tables are created in postgreSQL, as the mapdata table and rankings tables will follow this struct closely for columns |
| testData | Struct designed to hold test data in both ints and doubles |
| TextGen | Class responsible for inserting corresponding text turn-by-turn directions into the search results, to go along with the interactive route map |
| TileMaker | Class that produces the images necessary to show bike maps, in the form of tiles at particular zoom levels. Accomplished using the Qt gui package. Tiles must be generated only once for each zoom level |
| userPreferences | Holds all user preferences that can be entered at the GUI and used by searchParser and pathSearchAI |
