Transit Planner
1.0
An experiment on transfer patterns robustness
|
clear() (defined in QueryResult) | QueryResult | |
destLabels (defined in QueryResult) | QueryResult | |
ExplicitPath typedef (defined in QueryResult) | QueryResult | |
getTransferPattern(const TransitNetwork &network, LabelVec::Hnd destLabel) const (defined in QueryResult) | QueryResult | |
matrix (defined in QueryResult) | QueryResult | |
numSettledLabels (defined in QueryResult) | QueryResult | |
optimalCosts() const (defined in QueryResult) | QueryResult | |
optimalPaths(const TransitNetwork &network, string *log=NULL) const (defined in QueryResult) | QueryResult | |
optimalPaths(const QueryGraph &graph, string *log=NULL) const (defined in QueryResult) | QueryResult | |
optimalPenalty() const (defined in QueryResult) | QueryResult | |
Path typedef (defined in QueryResult) | QueryResult | |
QueryResult() (defined in QueryResult) | QueryResult | |
traceBackOptimalPaths() const (defined in QueryResult) | QueryResult | |
transferStops(const TransitNetwork &network) const (defined in QueryResult) | QueryResult |