#include <treeStrategy_3dTorus_minHops.h>
Public Member Functions | |
virtual SpanningTreeVertex * | buildNextGen (const Iterator firstVtx, const Iterator beyondLastVtx, const int maxBranches=2)=0 |
Concrete builders should implement this (preferably only for the appropriate specializations). |
Naturally, can also work with 3D meshes (portions of the torus).
Reduces hop-bytes by trying to reduce the total number of hops across the tree. Is implicitly node-aware as on-node PEs will have a distance of zero and will end up as direct children in the spanning tree. Does not pay any attention to reducing the number of bytes on the network by minimizing inter-node traffic. For that, refer to SpanningTreeStrategy_3dTorus_minBytesHops.
Specialized and implemented only for data type in input container = vtxType / SpanningTreeVertex.
Definition at line 26 of file treeStrategy_3dTorus_minHops.h.
virtual SpanningTreeVertex* topo::SpanningTreeStrategy_3dTorus_minHops< Iterator, ValueType >::buildNextGen | ( | const Iterator | firstVtx, | |
const Iterator | beyondLastVtx, | |||
const int | maxBranches = 2 | |||
) | [pure virtual] |
Concrete builders should implement this (preferably only for the appropriate specializations).
Implements topo::SpanningTreeStrategy< Iterator >.
Referenced by topo::topo::SpanningTreeStrategy_3dTorus_minHops< Iterator, vtxType >::buildNextGen().