IN_TREE           237 lib/graphcut.c 	assert(mytree[NR(p)]&IN_TREE);
IN_TREE           252 lib/graphcut.c 	assert(othertree[NR(p)]&IN_TREE);
IN_TREE           316 lib/graphcut.c     if((mytree[NR(pos)]&(IN_TREE|ACTIVE)) != (IN_TREE|ACTIVE)) {
IN_TREE           344 lib/graphcut.c 		posqueue_addpos(queue, newpos); mytree[NR(newpos)] |= ACTIVE|IN_TREE; // add
IN_TREE           418 lib/graphcut.c         if(weight && (flags[NR(newpos)]&IN_TREE)) {
IN_TREE           454 lib/graphcut.c             } else if((flags[NR(newpos)]&(ACTIVE|IN_TREE)) == IN_TREE) {
IN_TREE           483 lib/graphcut.c             bool_op(w, w->flags1, newpos, ~IN_TREE, 0);
IN_TREE           487 lib/graphcut.c                 bool_op(w, w->flags1, newpos, ~0, IN_TREE);
IN_TREE           507 lib/graphcut.c             bool_op(w, w->flags2, newpos, ~IN_TREE, 0);
IN_TREE           511 lib/graphcut.c                 bool_op(w, w->flags2, newpos, ~0, IN_TREE);
IN_TREE           556 lib/graphcut.c     posqueue_addpos(w->queue1, pos1); w->flags1[pos1->nr] |= ACTIVE|IN_TREE; 
IN_TREE           557 lib/graphcut.c     posqueue_addpos(w->queue2, pos2); w->flags2[pos2->nr] |= ACTIVE|IN_TREE;