comparison src/Finder.cpp @ 59:fb6e4829c1af cheap_diagonals

Weight of sqrt(2) in both cases

 } // setPathCost()
 
 void
 Finder::recalculatePathCostMatrix(int r1, int c1, int r2, int c2) 
 {
+    float diagonalWeight = sqrtf(2.f);
+    
     if (!find(r1,c1)) {
         std::cerr << "recalculatePathCostMatrix(" << r1 << "," << c1 << "): out of bounds" << std::endl;
         throw "recalculatePathCostMatrix index out of bounds";
     }
     int thisRowStart, c;

                 if (r > r1) {	// not first row
                     double min = -1;
                     if ((c > prevRowStart) && (c <= prevRowStop)) {
                         // diagonal from (r-1,c-1)
                         min = pm1->m_bestPathCost[r-1][c-pm1->m_first[r-1]-1] +
-                            newCost;
+                            newCost * diagonalWeight;
                         dir = Matcher::AdvanceBoth;
                     }
                     if ((c >= prevRowStart) && (c < prevRowStop)) {
                         // vertical from (r-1,c)
                         double cost = pm1->m_bestPathCost[r-1][c-pm1->m_first[r-1]] +