|
Transit Planner
1.0
An experiment on transfer patterns robustness
|
Public Member Functions | |
| TransitNetwork (const TransitNetwork &other) | |
| TransitNetwork & | operator= (const TransitNetwork &other) |
| void | reset () |
| void | validate () const |
| void | preprocess () |
| TransitNetwork | createTimeCompressedNetwork () const |
| FRIEND_TEST (DijkstraTest, compressedNetwork) | |
| const TransitNetwork | mirrored () const |
| const TransitNetwork | largestConnectedComponent () const |
| FRIEND_TEST (TransitNetworkTest, largestConnectedComponent) | |
| void | name (const string &name) |
| string | name () const |
| size_t | numNodes () const |
| size_t | numArcs () const |
| size_t | numStops () const |
| const Node & | node (const size_t node) const |
| const vector< vector< Arc > > & | adjacencyLists () const |
| const vector< Arc > & | adjacencyList (const size_t node) const |
| const Stop & | stop (const size_t stop) const |
| Stop & | stop (const size_t stop) |
| const vector< Arc > & | walkwayList (const int i) const |
| vector< Arc > | walkway (const int stopFrom, const int stopTo) const |
| const StopTree & | stopTree () const |
| int | addTransitNode (const int stopIndex, const Node::Type &type, int time) |
| void | addStop (Stop &stop) |
| void | addArc (int source, int target, int cost) |
| void | addArc (int source, int target, int cost, int penalty) |
| const Stop * | findNearestStop (const float lat, const float lon) const |
| vector< int > | findStartNodeSequence (const Stop &stop, const int ptime) const |
| const vector< int > | getDepNodes (const int stopIndex) const |
| int | stopIndex (const string &id) const |
| const GeoInfo & | geoInfo () const |
| string | debugString () const |
| string | debugStringOfWalkingGraph () const |
Static Public Attributes | |
| static const int | TRANSFER_BUFFER = 120 |
| static const float | MAX_WALKWAY_DIST = 100.0f |
Friends | |
| class | boost::serialization::access |
| class | GtfsParser |
1.7.6.1
