145             for(int i2=0; i2<binsDim2; i2++)  in initBaseTrees()  local
147                 m_3dNodes[i1][i2].resize(binsDim3);  in initBaseTrees()
148                 m_3dEdgesUp[i1][i2].resize(binsDim3);  in initBaseTrees()
149                 m_3dEdgesRight[i1][i2].resize(binsDim3);  in initBaseTrees()
150                 m_3dEdgesDeep[i1][i2].resize(binsDim3);  in initBaseTrees()
332     int i1,i2,i3;  in greedySolution3()  local
337         for(i2=0; i2<binsDim2; i2++)  in greedySolution3()
339             D[i1][i2].resize(binsDim3);  in greedySolution3()
341                 D[i1][i2][i3] = m_3dNodes[i1][i2][i3].d;  in greedySolution3()
351         for(i2=0; i2<binsDim2; i2++)  in greedySolution3()
354                 d1s[i1+1] -= D[i1][i2][i3];  in greedySolution3()
360     for(i2=0; i2<binsDim2-1; i2++)  in greedySolution3()
362         d2s[i2+1] = d2s[i2];  in greedySolution3()
366                 d2s[i2+1] -= D[i1][i2][i3];  in greedySolution3()
377             for(i2=0; i2<binsDim2; i2++)  in greedySolution3()
378                 d3s[i3+1] -= D[i1][i2][i3];  in greedySolution3()
388         for(i2=0; i2<binsDim2; i2++)  in greedySolution3()
392                 if(i3==binsDim3-1 && i2==binsDim2-1 && i1==binsDim1-1) break;  in greedySolution3()
395                 dFlow = D[i1][i2][i3];  in greedySolution3()
397                 f2 = (i2<(binsDim2-1))?fabs(dFlow+d2s[i2+1]):std::numeric_limits<float>::max();  in greedySolution3()
402                     pBV	= &(m_3dEdgesUp[i1][i2][i3]); // up  in greedySolution3()
403                     if(i2<binsDim2-1) m_NBVEdges[nNBV++] = &(m_3dEdgesRight[i1][i2][i3]);	// right  in greedySolution3()
404                     if(i3<binsDim3-1) m_NBVEdges[nNBV++] = &(m_3dEdgesDeep[i1][i2][i3]); // deep  in greedySolution3()
405                     D[i1+1][i2][i3]	+= dFlow; // maintain auxilary matrix  in greedySolution3()
410                     pBV	= &(m_3dEdgesRight[i1][i2][i3]); // right  in greedySolution3()
411                     if(i1<binsDim1-1) m_NBVEdges[nNBV++] = &(m_3dEdgesUp[i1][i2][i3]); // up  in greedySolution3()
412                     if(i3<binsDim3-1) m_NBVEdges[nNBV++] = &(m_3dEdgesDeep[i1][i2][i3]); // deep  in greedySolution3()
413                     D[i1][i2+1][i3]	+= dFlow; // maintain auxilary matrix  in greedySolution3()
414                     d2s[i2+1] += dFlow;  in greedySolution3()
418                     pBV	= &(m_3dEdgesDeep[i1][i2][i3]); // deep  in greedySolution3()
419                     if(i2<binsDim2-1) m_NBVEdges[nNBV++] = &(m_3dEdgesRight[i1][i2][i3]);	// right  in greedySolution3()
420                     if(i1<binsDim1-1) m_NBVEdges[nNBV++] = &(m_3dEdgesUp[i1][i2][i3]); // up  in greedySolution3()
421                     D[i1][i2][i3+1]	+= dFlow; // maintain auxilary matrix  in greedySolution3()