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

  /external/srec/srec/crec/
srec_results.c 131 *bestcost = stack->complete_paths[0]->costsofar;
185 partial_path* parp = stack->complete_paths[i];
217 free_partial_path(stack, stack->complete_paths[n]);
222 stack->complete_paths[i-1] = stack->complete_paths[i];
223 stack->complete_paths[i-1] = 0; /* empty the last one */
247 parp = stack->complete_paths[index];
248 *cost = stack->complete_paths[index]->costsofar;
299 parp = stack->complete_paths[n];
300 *cost = stack->complete_paths[n]->costsofar
    [all...]
astar.c 530 stack->complete_paths = (partial_path**)CALLOC_CLR(stack->max_complete_paths, sizeof(partial_path*), "search.astar.cplist");
558 FREE(stack->complete_paths);
609 stack->complete_paths[ stack->num_complete_paths++] = parp;
634 free_partial_path(stack, stack->complete_paths[i]);
702 print_partial_paths(stack->complete_paths, stack->num_complete_paths,
769 max_cost = stack->complete_paths[0]->costsofar + stack->prune_delta;
803 stack->complete_paths[ stack->num_complete_paths++] = extended_parp;
815 stack->complete_paths, if so just rejoin with that guy somehow */
869 sort_partial_paths(stack->complete_paths, stack->num_complete_paths);
874 print_partial_paths(stack->complete_paths, stack->num_complete_paths
    [all...]
  /external/srec/srec/include/
astar.h 101 partial_path** complete_paths; member in struct:__anon26467

Completed in 24 milliseconds