Transit Planner  1.0
An experiment on transfer patterns robustness
Public Member Functions | Static Public Member Functions | Static Public Attributes
TransferPatternRouter Class Reference

List of all members.

Public Member Functions

 TransferPatternRouter (const TransitNetwork &network)
 FRIEND_TEST (TransferPatternRouterTest, Constructor)
void prepare (const vector< Line > &lines)
void computeAllTransferPatterns (TPDB *tpdb)
const QueryGraph queryGraph (int depStop, int destStop) const
vector< QueryResult::Path > shortestPath (const int startStop, const int time, const int targetStop, string *log=NULL)
 FRIEND_TEST (TransferPatternRouterTest, dijkstraCompare_walkFirstStop)
 FRIEND_TEST (TransferPatternRouterTest, dijkstraCompare_walkIntermediateStop)
 FRIEND_TEST (TransferPatternRouterTest, dijkstraCompare_walkLastStop)
set< int > findBasicHubs (int numHubs)
void countStopFreq (const int seedStop, vector< IntPair > *stopFreqs) const
void logger (Logger *log)
const HubSet & hubs () const
void hubs (const HubSet &)
const TPDBtransferPatternsDB () const
void transferPatternsDB (const TPDB &db)
set< vector< int > > generateTransferPatterns (const int orig, const int dest) const
set< vector< int > > generateAllTransferPatterns (const int orig) const
string printPatterns (const set< vector< int > > &patterns)
const DirectConnectiondirectConnection ()

Static Public Member Functions

static set< vector< int > > computeTransferPatterns (const TransitNetwork &network, const int depStop, const HubSet &hubs)
static set< vector< int > > computeTransferPatternsToHubs (const TransitNetwork &network, const int depStop, const HubSet &hubs)
static set< vector< int > > computeTransferPatternsToAll (const TransitNetwork &network, const int depStop)

Static Public Attributes

static const int TIME_LIMIT = 1 * 60 * 60
static const unsigned char PENALTY_LIMIT = 3

The documentation for this class was generated from the following files:
 All Classes