|
Transit Planner
1.0
An experiment on transfer patterns robustness
|
Public Member Functions | |
| QueryGraph (const TPG &tpgOrigin, const int destStop) | |
| FRIEND_TEST (QueryGraphTest, Constructor) | |
| const set< int > & | successors (const int node) const |
| int | stopIndex (const int node) const |
| int | nodeIndex (const int stop) const |
| const int | sourceNode () const |
| const int | targetNode () const |
| const size_t | size () const |
| const size_t | countArcs () const |
| bool | empty () const |
| void | merge (const TPG &tpgOrigin, const int destStop) |
| FRIEND_TEST (QueryGraphTest, merge) | |
| FRIEND_TEST (QueryGraphTest, mergeGraphs) | |
| int | addStop (const int stop, const set< int > &successors) |
| FRIEND_TEST (QueryGraphTest, addStop) | |
| bool | containsPattern (const vector< int > &stops) const |
| const QueryGraph | findPattern (const vector< int > &stops) const |
| string | debugString () const |
| const vector< vector< int > > | generateTransferPatternsRecursive () const |
| const vector< vector< int > > | generateTransferPatterns () const |
Static Public Attributes | |
| static const int | INVALID_NODE = -1 |
1.7.6.1
