- std::vector<s_sg_platf_link_cbarg_t> linksUp; // From source to destination
- std::vector<s_sg_platf_link_cbarg_t> linksDown; // From destination to source
+ /* Links are dependant of the chosen network model, but must implement
+ * NetworkLink
+ */
+ std::vector<NetworkLink*> linksUp; // From source to destination
+ std::vector<NetworkLink*> linksDown; // From destination to source
/* As it is symetric, it might as well be first / second instead
* of source / destination
*/
FatTreeNode *source;
FatTreeNode *destination;
/* As it is symetric, it might as well be first / second instead
* of source / destination
*/
FatTreeNode *source;
FatTreeNode *destination;
unsigned int levels;
std::vector<int> lowerLevelNodesNumber; // number of children by node
std::vector<int> upperLevelNodesNumber; // number of parents by node
unsigned int levels;
std::vector<int> lowerLevelNodesNumber; // number of children by node
std::vector<int> upperLevelNodesNumber; // number of parents by node
std::vector<FatTreeNode*> nodes;
std::map<std::pair<int,int>, FatTreeLink*> links;
std::vector<unsigned int> nodesByLevel;
std::vector<FatTreeNode*> nodes;
std::map<std::pair<int,int>, FatTreeLink*> links;
std::vector<unsigned int> nodesByLevel;