ACTIVE            316 lib/graphcut.c     if((mytree[NR(pos)]&(IN_TREE|ACTIVE)) != (IN_TREE|ACTIVE)) {
ACTIVE            331 lib/graphcut.c                 posqueue_addpos(queue, pos); mytree[NR(pos)] |= ACTIVE; // re-add, this vertex might have other connections
ACTIVE            344 lib/graphcut.c 		posqueue_addpos(queue, newpos); mytree[NR(newpos)] |= ACTIVE|IN_TREE; // add
ACTIVE            349 lib/graphcut.c     mytree[NR(pos)] &= ~ACTIVE;
ACTIVE            454 lib/graphcut.c             } else if((flags[NR(newpos)]&(ACTIVE|IN_TREE)) == IN_TREE) {
ACTIVE            459 lib/graphcut.c                 flags[NR(newpos)]|=ACTIVE;
ACTIVE            482 lib/graphcut.c             w->flags1[NR(newpos)] &= ACTIVE;
ACTIVE            506 lib/graphcut.c             w->flags2[NR(newpos)] &= ACTIVE;
ACTIVE            556 lib/graphcut.c     posqueue_addpos(w->queue1, pos1); w->flags1[pos1->nr] |= ACTIVE|IN_TREE; 
ACTIVE            557 lib/graphcut.c     posqueue_addpos(w->queue2, pos2); w->flags2[pos2->nr] |= ACTIVE|IN_TREE;