AddNode(int time, int currentLevel, int preIndex, int nodek1, int MTk1, int nodek2, int MTk2, float cost, float weightMTinTLDiffCost, float TL1TL2DivCost, float flowDiffCost, float divDiffCost, float MIDiffCost, float divMTaMTbCost, float timeCost) | SearchTree | [inline] |
CheckMTCoherentNode(int time, int currentLevel, int preIndex, int MTk1, int MTk2) | SearchTree | [inline] |
CheckUnusedNode(int time, int currentLevel, int preIndex, int nodek2, int MTk2) | SearchTree | [inline] |
emptyTree | SearchTree | |
getPreTimeCorresMTIndex(int time, int currentLevel, int preIndex, int nodek1, int MTk1) | SearchTree | [inline] |
getPreTimeCorresNodeIndex(int time, int currentLevel, int preIndex, int nodek1, int MTk1) | SearchTree | [inline] |
IndexminiCost | SearchTree | |
Init(int nbTimes, int nbMT, int *nbNodes1) | SearchTree | [inline] |
LowestCosts(float *costs) | SearchTree | [inline] |
LowestCosts(float *costs, float *para) | SearchTree | [inline] |
miniCost | SearchTree | |
nbMTClusters | SearchTree | |
nbTimeLevels | SearchTree | |
nbTimeSamp | SearchTree | |
nbTotalLevels | SearchTree | |
PruneTree(int nbMiniBranches, int currentLevel) | SearchTree | [inline] |
SearchTree() | SearchTree | [inline] |
tree | SearchTree | |
~SearchTree() | SearchTree | [inline] |