* Things are rather complex here because we have to find the path from ASes to ASes, and within each.
* In addition, the different ASes may use differing routing models.
* Some ASes may be routed in full, others may have only some connection information and use a shortest path on top of that, and so on.
* Things are rather complex here because we have to find the path from ASes to ASes, and within each.
* In addition, the different ASes may use differing routing models.
* Some ASes may be routed in full, others may have only some connection information and use a shortest path on top of that, and so on.
*
* So, the path is constructed recursively, with each traversed AS adding its information to the set.
* The algorithm for that is explained in http://hal.inria.fr/hal-00650233/
*
* So, the path is constructed recursively, with each traversed AS adding its information to the set.
* The algorithm for that is explained in http://hal.inria.fr/hal-00650233/
static void getRouteRecursive(surf::NetCard *src, surf::NetCard *dst, /* OUT */ std::vector<surf::Link*> * links, double *latency);
static void getRouteRecursive(surf::NetCard *src, surf::NetCard *dst, /* OUT */ std::vector<surf::Link*> * links, double *latency);
- enum RoutingKind {
- ROUTING_NULL = 0, /**< Undefined type */
- ROUTING_BASE, /**< Base case: use simple link lists for routing */
- ROUTING_RECURSIVE /**< Recursive case: also return gateway informations */
+ enum class RoutingMode {
+ unset = 0, /**< Undefined type */
+ base, /**< Base case: use simple link lists for routing */
+ recursive /**< Recursive case: also return gateway information */