|
Transit Planner
1.0
An experiment on transfer patterns robustness
|
Public Types | |
| typedef LabelVec::Hnd | Hnd |
|
typedef vector< LabelVec > ::const_iterator | const_iterator |
Public Member Functions | |
| void | resize (const int numNodes, const unsigned char maxPenalty) |
| bool | candidate (const int at, unsigned int cost, unsigned char penalty) const |
| bool | contains (const int at, unsigned char penalty) const |
| bool | closed (const int at, unsigned char penalty) const |
| Hnd | add (const int at, const unsigned int cost, const unsigned char penalty, const unsigned char maxPenalty) |
| Hnd | add (const int at, const unsigned int cost, const unsigned char penalty, const unsigned char maxPenalty, const bool walk, const bool inactive, const Hnd &parent) |
| int | pruneInactive () |
| Hnd | parent (const Hnd &succ) const |
| const LabelVec & | at (const int at) const |
| LabelVec & | at (const int at) |
| void | deactivate (const int at, const unsigned int cost, const unsigned char penalty) |
| const_iterator | cbegin () const |
| const_iterator | cend () const |
| int | size () const |
| int | numLabels () const |
1.7.6.1
