- unsigned int level; // The 0th level represents the leafs of the PGFT
- unsigned int position; // Position in the level
+ /* \brief Level into the tree, with 0 being the leafs
+ */
+ unsigned int level;
+ /* \brief Position into the level, starting from 0
+ */
+ unsigned int position;
+ /* In order to link nodes between them, each one must be assigned a label,
+ * consisting of l integers, l being the levels number of the tree. Each label
+ * is unique in the level, and the way it is generated allows the construction
+ * of a fat tree which fits the desired topology
+ */