![]() |
Eclipse SUMO - Simulation of Urban MObility
|
#include <SPTree.h>
Data Structures | |
| class | EdgeByTTComparator |
Public Types | |
| typedef std::pair< const C *, const C * > | CHConnectionPair |
| typedef std::vector< CHConnectionPair > | CHConnectionPairs |
| typedef std::vector< C > | CHConnections |
Public Member Functions | |
| const CHConnectionPairs & | getNeededShortcuts (const E *excluded) |
| void | init () |
| void | rebuildFrom (E *start, const E *excluded) |
| build a shortest path tree from start to a depth of myMaxdepth. The given edge is excluded from this tree | |
| void | registerForValidation (const C *aInfo, const C *fInfo) |
| save source/target pair for later validation | |
| SPTree (int maxDepth, bool validatePermissions) | |
| Constructor. | |
| bool | validatePermissions () |
| whether permissions should be validated; | |
Private Member Functions | |
| void | debugPrintVector (std::vector< E * > &vec, E *start, const E *excluded) |
| double | dijkstraTT (E *start, E *dest, const E *excluded, SVCPermissions permissions) |
Private Attributes | |
| EdgeByTTComparator | myCmp |
| comparator for search queue | |
| std::vector< E * > | myFound |
| the list of visited edges (used when resetting) | |
| std::vector< E * > | myFrontier |
| the min edge heap | |
| int | myMaxDepth |
| maximum search depth | |
| CHConnectionPairs | myNeededShortcuts |
| vector of needed shortcuts after validation | |
| CHConnectionPairs | myShortcutsToValidate |
| vector of needed shortcuts after validation | |
| bool | myValidatePermissions |
| whether permissions should be validated | |
| typedef std::vector<CHConnectionPair> SPTree< E, C >::CHConnectionPairs |
Constructor.
Definition at line 62 of file SPTree.h.
References myMaxDepth, myValidatePermissions, and validatePermissions().
|
inlineprivate |
|
inlineprivate |
Definition at line 160 of file SPTree.h.
References init(), myCmp, myFound, myFrontier, and myMaxDepth.
Referenced by getNeededShortcuts().
|
inline |
Definition at line 140 of file SPTree.h.
References dijkstraTT(), myNeededShortcuts, myShortcutsToValidate, and myValidatePermissions.
Referenced by CHBuilder< E, V >::CHInfo::updateShortcuts().
Definition at line 68 of file SPTree.h.
References myFound, and myFrontier.
Referenced by dijkstraTT(), and rebuildFrom().
|
inline |
build a shortest path tree from start to a depth of myMaxdepth. The given edge is excluded from this tree
Definition at line 85 of file SPTree.h.
References init(), myCmp, myFound, myFrontier, and myMaxDepth.
Referenced by CHBuilder< E, V >::CHInfo::updateShortcuts().
|
inline |
save source/target pair for later validation
Definition at line 132 of file SPTree.h.
References myShortcutsToValidate, and myValidatePermissions.
Referenced by CHBuilder< E, V >::CHInfo::updateShortcuts().
whether permissions should be validated;
Definition at line 127 of file SPTree.h.
References myValidatePermissions.
Referenced by SPTree(), and CHBuilder< E, V >::CHInfo::updateShortcuts().
|
private |
comparator for search queue
Definition at line 223 of file SPTree.h.
Referenced by dijkstraTT(), and rebuildFrom().
the list of visited edges (used when resetting)
Definition at line 220 of file SPTree.h.
Referenced by debugPrintVector(), dijkstraTT(), init(), and rebuildFrom().
the min edge heap
Definition at line 218 of file SPTree.h.
Referenced by dijkstraTT(), init(), and rebuildFrom().
maximum search depth
Definition at line 226 of file SPTree.h.
Referenced by dijkstraTT(), rebuildFrom(), and SPTree().
|
private |
vector of needed shortcuts after validation
Definition at line 234 of file SPTree.h.
Referenced by getNeededShortcuts().
|
private |
vector of needed shortcuts after validation
Definition at line 232 of file SPTree.h.
Referenced by getNeededShortcuts(), and registerForValidation().
whether permissions should be validated
Definition at line 229 of file SPTree.h.
Referenced by getNeededShortcuts(), registerForValidation(), SPTree(), and validatePermissions().