+ FatTreeNode *source, *destination, *currentNode;
+ std::vector<NetworkLink*> route;
+ source = this->nodes.find(src->getId())->second;
+ destination = this->nodes.find(dst->getId())->second;
+
+
+
+ currentNode = source;
+
+ // up part
+ while (!isInSubTree(currentNode, destination)) {
+ int d, k; // as in d-mod-k
+ d = destination->position;
+
+ for (unsigned int i = 0 ; i < currentNode->level ; i++) {
+ d /= this->upperLevelNodesNumber[i];
+ }
+ k = this->upperLevelNodesNumber[currentNode->level] *
+ this->lowerLevelNodesNumber[currentNode->level];
+ d = d % k;
+ route.push_back(currentNode->parents[d]->upLink);
+ if(latency) {
+ *latency += currentNode->parents[d]->upLink->getLatency();
+ }
+ currentNode = currentNode->parents[d]->upNode;
+ }
+
+ // Down part
+ while(currentNode != destination) {
+ for(unsigned int i = 0 ; i < currentNode->children.size() ; i++) {
+ if(i % this->lowerLevelNodesNumber[currentNode->level] ==
+ destination->label[currentNode->level]) {
+ route.push_back(currentNode->children[i]->downLink);
+ if(latency) {
+ *latency += currentNode->children[i]->downLink->getLatency();
+ }
+ currentNode = currentNode->children[i]->downNode;
+ }
+ }
+ }
+
+ for (unsigned int i = 0 ; i < route.size() ; i++) {
+ xbt_dynar_push_as(into->link_list, void*, route[i]);
+ }
+