-This is taken from figure 1/ b/ of the paper "D-Mod-K Routing Providing
-Non-Blocking Traffic for Shift Permutations on Real Life Fat Trees"
-available at webee.technion.ac.il/publication-link/index/id/574
-This defines a two levels fat-tree, with 4 leaf switches connected to 4 nodes each
-and 2 core switches connected to each leaf switch by two cables
--->
+This is taken from figure 1/ b/ of the paper "D-Mod-K Routing Providing on-Blocking Traffic for Shift Permutations on
+Real Life Fat Trees" available at webee.technion.ac.il/publication-link/index/id/574
+This defines a two levels fat-tree, with 4 leaf switches connected to 4 nodes each and 2 core switches connected to
+each leaf switch by two cables -->