|
Transit Planner
1.0
An experiment on transfer patterns robustness
|
Classes | |
| struct | PathCmp |
Public Types | |
|
typedef std::pair < LabelVec::Hnd, vector< int > > | Path |
|
typedef pair< LabelVec::Hnd, vector< LabelVec::Hnd > > | ExplicitPath |
Public Member Functions | |
| void | clear () |
| int | optimalCosts () const |
| int | optimalPenalty () const |
| set< ExplicitPath > | traceBackOptimalPaths () const |
| vector< Path > | optimalPaths (const TransitNetwork &network, string *log=NULL) const |
| vector< Path > | optimalPaths (const QueryGraph &graph, string *log=NULL) const |
| set< vector< int > > | transferStops (const TransitNetwork &network) const |
| vector< int > | getTransferPattern (const TransitNetwork &network, LabelVec::Hnd destLabel) const |
Public Attributes | |
| LabelVec | destLabels |
| LabelMatrix | matrix |
| size_t | numSettledLabels |
1.7.6.1
