8.5 Corrigés des exercices
}
}
int ht = abs (distFrom [i] [p.x] [p.y] -
distFrom [i] [goal .x] [goal .y]);
if ( ht > h)
h = ht ;
return h;
void setTriangularPoint ( int n, Point p) {
pointTriangular [n] = p;
}
Point noPoint ;
noPoint .set (-1, -1);
dijkstra (pointTriangular [n] , noPoint );
for (int il = O; il < height ; il++)
for (int jl = O; jl < width ; jl++)
distFrom [n] [il ] [j l] = g [il ] [jl ];
167