Transit Planner
1.0
An experiment on transfer patterns robustness
|
dijkstraQuery(const TransitNetwork &network, const HubSet *hubs, const int dep, const int time, const int dest, QueryResult *resultPtr) (defined in Command) | Command | [static] |
execute(Server &server, shared_ptr< tcp::socket > socket, const string &com, const StrStrMap &args, Logger &log) (defined in Command) | Command | [static] |
getRandQueries(int numQueries, int numStops, int seed) (defined in Command) | Command | [static] |
operator()(Server &server, const StrStrMap &args, Logger &log)=0 (defined in Command) | Command | [pure virtual] |
send(shared_ptr< tcp::socket > socket, const string &msg, Logger &log) (defined in Command) | Command | [static] |
~Command() (defined in Command) | Command | [inline, virtual] |