NR 112 lib/graphcut.c halfedge_t*back = w->back[NR(e->pos)]; NR 113 lib/graphcut.c printf("%d(%d) ", NR(e->pos), back?NR(back->fwd->node):-1); NR 212 lib/graphcut.c DBG printf("walk back up (1) to %d\n", NR(work->pos1)); NR 214 lib/graphcut.c halfedge_t*back = work->back[NR(p)]; NR 215 lib/graphcut.c DBG printf("walk backward (1): %d %d\n", NR(p), back?NR(back->fwd->node):-1); NR 217 lib/graphcut.c p = work->back[NR(p)]->fwd->node; NR 223 lib/graphcut.c DBG printf("walk back up (2) to %d\n", NR(work->pos2)); NR 226 lib/graphcut.c DBG printf("walk backward (2): %d\n", NR(p)); NR 227 lib/graphcut.c p = work->back[NR(p)]->fwd->node; NR 237 lib/graphcut.c assert(mytree[NR(p)]&IN_TREE); NR 238 lib/graphcut.c halfedge_t*dir = work->back[NR(p)]; NR 252 lib/graphcut.c assert(othertree[NR(p)]&IN_TREE); NR 253 lib/graphcut.c halfedge_t*dir = work->back[NR(p)]; NR 275 lib/graphcut.c printf("%d (firsthalf: %d)", NR(n), path->firsthalf[t]); NR 316 lib/graphcut.c if((mytree[NR(pos)]&(IN_TREE|ACTIVE)) != (IN_TREE|ACTIVE)) { NR 318 lib/graphcut.c DBG printf("node %d is deleted or inactive\n", NR(pos)); NR 326 lib/graphcut.c if(mytree[NR(newpos)]) continue; // already known NR 329 lib/graphcut.c if(othertree[NR(newpos)]) { NR 330 lib/graphcut.c DBG printf("found connection: %d connects to %d\n", NR(pos), NR(newpos)); NR 331 lib/graphcut.c posqueue_addpos(queue, pos); mytree[NR(pos)] |= ACTIVE; // re-add, this vertex might have other connections NR 341 lib/graphcut.c DBG printf("advance from %d to new pos %d\n", NR(pos), NR(newpos)); NR 342 lib/graphcut.c w->back[NR(newpos)] = e->fwd; NR 344 lib/graphcut.c posqueue_addpos(queue, newpos); mytree[NR(newpos)] |= ACTIVE|IN_TREE; // add NR 349 lib/graphcut.c mytree[NR(pos)] &= ~ACTIVE; NR 372 lib/graphcut.c flags[NR(p)] = (flags[NR(p)]&and)|or; NR 391 lib/graphcut.c DBG printf("%d->%d (%d)\n", NR(path->dir[t]->node), NR(path->dir[t]->fwd->node), w); NR 418 lib/graphcut.c if(weight && (flags[NR(newpos)]&IN_TREE)) { NR 420 lib/graphcut.c NR(pos), NR(newpos), NR(e->node), NR(e->fwd->node), reverse); NR 422 lib/graphcut.c w->back[NR(pos)] = e; NR 432 lib/graphcut.c w->flags1[NR(n)] = 0; NR 433 lib/graphcut.c w->flags2[NR(n)] = 0; NR 434 lib/graphcut.c w->back[NR(n)] = 0; NR 441 lib/graphcut.c DBG printf("destroying subtree starting with %d\n", NR(pos)); NR 454 lib/graphcut.c } else if((flags[NR(newpos)]&(ACTIVE|IN_TREE)) == IN_TREE) { NR 459 lib/graphcut.c flags[NR(newpos)]|=ACTIVE; NR 465 lib/graphcut.c DBG printf("removed pos %d\n", NR(p)); NR 479 lib/graphcut.c DBG printf("remove link %d -> %d from tree 1\n", NR(pos), NR(newpos)); NR 482 lib/graphcut.c w->flags1[NR(newpos)] &= ACTIVE; NR 503 lib/graphcut.c DBG printf("remove link %d->%d from tree 2\n", NR(pos), NR(newpos)); NR 506 lib/graphcut.c w->flags2[NR(newpos)] &= ACTIVE; NR 569 lib/graphcut.c DBG printf("extend 1 from %d (%d edges)\n", NR(p1), node_count_edges(p1)); NR 581 lib/graphcut.c DBG printf("extend 2 from %d (%d edges)\n", NR(p2), node_count_edges(p2));