halfedge_t         58 lib/graphcut.c     halfedge_t**back;
halfedge_t        112 lib/graphcut.c 	halfedge_t*back = w->back[NR(e->pos)];
halfedge_t        145 lib/graphcut.c 	halfedge_t*e = graph->nodes[t].edges;
halfedge_t        147 lib/graphcut.c 	    halfedge_t*next = e->next;
halfedge_t        161 lib/graphcut.c     workspace->back = rfx_calloc(graph->num_nodes*sizeof(halfedge_t*));
halfedge_t        183 lib/graphcut.c     halfedge_t**dir;
halfedge_t        192 lib/graphcut.c     p->dir = malloc(sizeof(halfedge_t*)*len);
halfedge_t        205 lib/graphcut.c static path_t*extract_path(graphcut_workspace_t*work, unsigned char*mytree, unsigned char*othertree, node_t*pos, node_t*newpos, halfedge_t*dir)
halfedge_t        214 lib/graphcut.c 	halfedge_t*back = work->back[NR(p)];
halfedge_t        238 lib/graphcut.c 	halfedge_t*dir = work->back[NR(p)];
halfedge_t        253 lib/graphcut.c 	halfedge_t*dir = work->back[NR(p)];
halfedge_t        322 lib/graphcut.c     halfedge_t*e = pos->edges;
halfedge_t        355 lib/graphcut.c     halfedge_t*e = node->edges;
halfedge_t        373 lib/graphcut.c 	halfedge_t*e = p->edges;
halfedge_t        409 lib/graphcut.c     halfedge_t*e = pos->edges;
halfedge_t        435 lib/graphcut.c     halfedge_t*e = n->edges;
halfedge_t        449 lib/graphcut.c 	halfedge_t*e = p->edges;
halfedge_t        475 lib/graphcut.c 	halfedge_t*dir = path->dir[t];
halfedge_t        498 lib/graphcut.c         halfedge_t*dir = path->dir[t-1]->fwd;
halfedge_t        525 lib/graphcut.c 	halfedge_t*e = g->nodes[t].edges;
halfedge_t        539 lib/graphcut.c 	halfedge_t*e = g->nodes[t].edges;
halfedge_t        608 lib/graphcut.c halfedge_t*graph_add_edge(node_t*from, node_t*to, weight_t forward_weight, weight_t backward_weight)
halfedge_t        610 lib/graphcut.c     halfedge_t*e1 = (halfedge_t*)rfx_calloc(sizeof(halfedge_t));
halfedge_t        611 lib/graphcut.c     halfedge_t*e2 = (halfedge_t*)rfx_calloc(sizeof(halfedge_t));
halfedge_t        632 lib/graphcut.c     halfedge_t*e = n->edges;
halfedge_t         36 lib/graphcut.h     halfedge_t*next;
halfedge_t         40 lib/graphcut.h     halfedge_t*edges;
halfedge_t         55 lib/graphcut.h halfedge_t*graph_add_edge(node_t*from, node_t*to, weight_t forward_weight, weight_t backward_weight);