|
Transit Planner
1.0
An experiment on transfer patterns robustness
|
Public Types | |
|
typedef priority_queue < LabelMatrix::Hnd, vector < LabelMatrix::Hnd > , LabelMatrix::Hnd::Comp > | PriorityQueue |
Public Member Functions | |
| Dijkstra (const TransitNetwork &network) | |
| void | findShortestPath (const vector< int > &depNodes, const int destStop, QueryResult *result) const |
| void | logger (const Logger *log) |
| void | maxPenalty (const unsigned char pen) |
| unsigned char | maxPenalty () const |
| void | maxHubPenalty (const unsigned char pen) |
| unsigned char | maxHubPenalty () const |
| void | maxCost (const unsigned int cost) |
| unsigned int | maxCost () const |
| void | hubs (const HubSet *hubs) |
| const HubSet * | hubs () const |
| void | startTime (const int startTime) |
| const int | startTime () const |
1.7.6.1