A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Fat trees progress
[simgrid.git]
/
src
/
surf
/
surf_routing_cluster_fat_tree.hpp
diff --git
a/src/surf/surf_routing_cluster_fat_tree.hpp
b/src/surf/surf_routing_cluster_fat_tree.hpp
index
7aaf9b1
..
1430c43
100644
(file)
--- a/
src/surf/surf_routing_cluster_fat_tree.hpp
+++ b/
src/surf/surf_routing_cluster_fat_tree.hpp
@@
-65,8
+65,8
@@
public:
protected:
//description of a PGFT (TODO : better doc)
unsigned int levels;
protected:
//description of a PGFT (TODO : better doc)
unsigned int levels;
- std::vector<int> lowerLevelNodesNumber;
- std::vector<int> upperLevelNodesNumber;
+ std::vector<int> lowerLevelNodesNumber;
// number of children by node
+ std::vector<int> upperLevelNodesNumber;
// number of parents by node
std::vector<int> lowerLevelPortsNumber;
std::vector<FatTreeNode*> nodes;
std::vector<int> lowerLevelPortsNumber;
std::vector<FatTreeNode*> nodes;
@@
-74,6
+74,6
@@
protected:
std::vector<unsigned int> nodesByLevel;
void addLink(FatTreeNode *parent, FatTreeNode *child);
std::vector<unsigned int> nodesByLevel;
void addLink(FatTreeNode *parent, FatTreeNode *child);
- void getLevelPosition(const unsigned int level, int
&position, int &
size);
+ void getLevelPosition(const unsigned int level, int
*position, int *
size);
};
#endif
};
#endif