Transit Planner  1.0
An experiment on transfer patterns robustness
QueryGraph Member List
This is the complete list of members for QueryGraph, including all inherited members.
addStop(const int stop, const set< int > &successors) (defined in QueryGraph)QueryGraph
containsPattern(const vector< int > &stops) const (defined in QueryGraph)QueryGraph
countArcs() const (defined in QueryGraph)QueryGraph
debugString() const (defined in QueryGraph)QueryGraph
empty() const (defined in QueryGraph)QueryGraph
findPattern(const vector< int > &stops) const (defined in QueryGraph)QueryGraph
FRIEND_TEST(QueryGraphTest, Constructor) (defined in QueryGraph)QueryGraph
FRIEND_TEST(QueryGraphTest, merge) (defined in QueryGraph)QueryGraph
FRIEND_TEST(QueryGraphTest, mergeGraphs) (defined in QueryGraph)QueryGraph
FRIEND_TEST(QueryGraphTest, addStop) (defined in QueryGraph)QueryGraph
generateTransferPatterns() const (defined in QueryGraph)QueryGraph
generateTransferPatternsRecursive() const (defined in QueryGraph)QueryGraph
INVALID_NODE (defined in QueryGraph)QueryGraph [static]
merge(const TPG &tpgOrigin, const int destStop) (defined in QueryGraph)QueryGraph
nodeIndex(const int stop) const (defined in QueryGraph)QueryGraph
QueryGraph(const TPG &tpgOrigin, const int destStop) (defined in QueryGraph)QueryGraph
size() const (defined in QueryGraph)QueryGraph [inline]
sourceNode() const (defined in QueryGraph)QueryGraph [inline]
stopIndex(const int node) const (defined in QueryGraph)QueryGraph
successors(const int node) const (defined in QueryGraph)QueryGraph
targetNode() const (defined in QueryGraph)QueryGraph
 All Classes