HomeSort by relevance Sort by last modified time
    Searched refs:depthMap (Results 1 - 4 of 4) sorted by null

  /external/srec/tools/grxmlcompile/
sub_base.cpp 167 void SubGraph::ReverseDepthOnTerminal (int *depthMap)
171 ReverseDepthData (arc[ii]->GetFromId(), depthMap, 1);
175 void SubGraph::ReverseDepthData (int startId, int *depthMap, int depth)
179 if (depthMap[startId] > depth)
180 depthMap[startId]= depth;
190 ReverseDepthData (nextId, depthMap, depth+1);
196 void SubGraph::ForwardDepthData (int startId, int *depthMap, int depth)
200 if (depthMap[startId] > depth)
201 depthMap[startId]= depth;
211 ForwardDepthData (nextId, depthMap, depth+1)
    [all...]
sub_grph.h 247 void ForwardDepthData (int startId, int *depthMap, int depth);
248 void ReverseDepthData (int startId, int *depthMap, int depth);
249 void ReverseDepthOnTerminal (int *depthMap);
252 void IdentifyEquivalence (int *depthMap, int *equivMap);
sub_grph.cpp 631 int ii, *equivMap, *depthMap;
638 depthMap= new int [numVertex];
640 depthMap[ii]= MAXNUM;
642 ReverseDepthData (lastId, depthMap, 1);
643 ReverseDepthOnTerminal (depthMap);
645 if (depthMap[ii] == MAXNUM)
646 depthMap[ii]= -1;
655 IdentifyEquivalence (depthMap, equivMap);
665 delete [] depthMap;
sub_min.cpp 120 void SubGraph::IdentifyEquivalence (int *depthMap, int *equivMap)
126 if (maxDepth < depthMap[ii])
127 maxDepth= depthMap[ii];
135 if (depthMap[ii] == dd && ii == equivMap[ii]) {
138 if (depthMap[jj] == dd && jj == equivMap[jj]) {

Completed in 24 milliseconds