COUNTER_LIST
#undef CTR
+static PotentialResult ****results;
+ /* results[start_isle_ix][finalisle][midisle]-> */
+
int main(int argc, const char **argv) {
const char *arg;
double val= value_route(ni, ia, 0);
printf("route value is %g\n", val);
} else if (!strcmp(arg,"search")) {
+ results= mcalloc(sizeof(*results)*argc);
max_dist= atoi(*argv++);
- while ((arg= *argv++))
- search(atoi(arg));
+ int resultsix= 0;
+ while ((arg= *argv++)) {
+ search(atoi(arg), &results[resultsix]);
+ resultsix++;
+ }
+
+ int i, midisle, finisle;
+ for (i=0; i<resultsix; i++) {
+ fprintf(stderr,"================== start #%d ==================\n",i);
+ PotentialResult ***strat_resultsix= results[i];
+ if (!strat_resultsix) continue;
+ fprintf(stderr," ");
+ for (midisle=0; midisle<islandtablesz; midisle++) {
+ fprintf(stderr,"|mi%-3d",midisle);
+ }
+ fprintf(stderr,"\n");
+ for (finisle=0; finisle<islandtablesz; finisle++) {
+ PotentialResult **strat_finisle= strat_resultsix[finisle];
+ if (!strat_finisle) continue;
+ fprintf(stderr,"f%-3d",finisle);
+ for (midisle=0; midisle<islandtablesz; midisle++) {
+ PotentialResult *result= strat_finisle[midisle];
+ if (!result) {
+ fprintf(stderr,"| ");
+ } else {
+ if (result->absolute < 1000) fprintf(stderr,"| <");
+ else fprintf(stderr,"|%2d",(int)(result->absolute / 1000));
+ fprintf(stderr," ");
+ if (result->perleague < 100) fprintf(stderr," <");
+ else fprintf(stderr,"%2d",(int)(result->perleague / 100));
+ }
+ }
+ fprintf(stderr,"\n");
+ }
+ }
} else {
abort();
}