Lines Matching defs:cost
70 float cost; ///< path cost
94 path[0][cb].cost = 0.0f;
103 path[swb+1][cb].cost = path[swb][cb].cost;
117 path[swb+1][cb].cost = INFINITY;
128 cost_stay_here = path[swb][cb].cost + rd;
135 path[swb+1][cb].cost = cost_get_here;
139 path[swb+1][cb].cost = cost_stay_here;
142 if (path[swb+1][cb].cost < next_minrd) {
143 next_minrd = path[swb+1][cb].cost;
155 if (path[max_sfb][cb].cost < path[max_sfb][idx].cost)
189 float cost;
292 paths[0][i].cost = 0.0f;
297 paths[j][i].cost = INFINITY;
354 float cost;
355 cost = paths[idx - 1][i].cost + dist
357 if (cost < paths[idx][q].cost) {
358 paths[idx][q].cost = cost;
365 paths[idx][q].cost = paths[idx - 1][q].cost + 1;
375 mincost = paths[idx][0].cost;
378 if (paths[idx][i].cost < mincost) {
379 mincost = paths[idx][i].cost;