Main Page   Compound List   File List   Compound Members   File Members   Related Pages  

SearchTree Class Reference

SearchTree object which is a tree used by MatchCost to find the minimal matching cost among all possible mapping functions. More...

#include <SearchTree.hh>

List of all members.

Public Methods

 SearchTree ()
 constructor setting the attribut 'emptyTree' to true.

virtual ~SearchTree ()
 destructor clearing the tree structure.

void Init (int nbTimes, int nbMT, int *nbNodes1)
 memory allocation, intialisation of the tree structure (vector of Object TreeNode).

bool CheckUnusedNode (int time, int currentLevel, int preIndex, int nodek2, int MTk2)
 Method used in the matching procedure to check that the node to match was not previously matched.

bool CheckMTCoherentNode (int time, int currentLevel, int preIndex, int MTk1, int MTk2)
 Method used in the matching procedure to check that the node to match is associated to the same MT class as the other previously matched nodes.

int getPreTimeCorresNodeIndex (int time, int currentLevel, int preIndex, int nodek1, int MTk1)
 Method used in the matching procedure to return the index of the node in the previous level of the tree linked to the current node to match.

int getPreTimeCorresMTIndex (int time, int currentLevel, int preIndex, int nodek1, int MTk1)
 Method used in the matching procedure to return the MT class index related to the node in the previous level of the tree linked to the current node to match.

void 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)
 Method used in the matching procedure to add a Node in the tree.

float LowestCosts (float *costs)
 Method used in the matching procedure to return the costs related to the contribution of the different graph's attribute for the best mapping function (path of minimal cost).

float LowestCosts (float *costs, float *para)
 Method used when updating the matching costs with a new parameter vector while using the already created tree structure. It returns the updated costs related to the contribution of the different graph's attribute for the updated best mapping function (path of minimal cost).

void PruneTree (int nbMiniBranches, int currentLevel)
 Method used during the matching procedure to select only a number of 'nbMiniBranches' best paths in the search tree.


Public Attributes

vector< TreeNode > * tree
 tree structures, with at each level a vector of objects called TreeNode.

int nbTimeSamp
 number of time samples of the sub-graphs used in the matching function.

int nbMTClusters
 number of MT class considered per sub-graphs.

int * nbTimeLevels
 array of number of nodes to match at the different time samples. In other words, number of level in the tree for each time sample.

int nbTotalLevels
 Total number of nodes to match. In other words, total number of level in the tree.

int IndexminiCost
 Index of the path with the minimal cost.

float miniCost
 minimal cost associated to the best path.

bool emptyTree
 flag to precise if there a Tree structure was previously created.


Detailed Description

SearchTree object which is a tree used by MatchCost to find the minimal matching cost among all possible mapping functions.

Definition at line 32 of file SearchTree.hh.


The documentation for this class was generated from the following file:
Generated on Thu Feb 17 11:03:20 2005 for Interactive Learning of Sub-Graphs Semantics by doxygen1.2.14 written by Dimitri van Heesch, © 1997-2002