|
Transit Planner
1.0
An experiment on transfer patterns robustness
|
Classes | |
| struct | Field |
| class | Hnd |
Public Types | |
|
typedef vector< Hnd > ::const_iterator | const_iterator |
Public Member Functions | |
| LabelVec (const int at, const unsigned char maxPenalty) | |
| const_iterator | begin () const |
| const_iterator | end () const |
| bool | candidate (const unsigned int cost, const unsigned char penalty) const |
| Field * | add (const unsigned int cost, const unsigned char penalty, const unsigned char maxPenalty, const bool walk, const bool inactive, Field *parent) |
| void | add (const Hnd &label, const Hnd &parent) |
| const Field & | field (const unsigned char penalty) const |
| int | pruneInactive () |
| int | size () const |
| int | minCost () const |
| int | minPenalty () const |
| int | at () const |
| void | deactivate (const unsigned int cost, const unsigned char penalty) |
1.7.6.1
