Lines Matching defs:edge_list
86 VEC(int,heap) *edge_list;
224 g->edge_list = VEC_alloc (int, heap, 20);
239 VEC_truncate (int, g->edge_list, 0);
250 VEC_free (int, heap, g->edge_list);
286 VEC_safe_push (int, heap, g->edge_list, pred);
287 VEC_safe_push (int, heap, g->edge_list, succ);
299 for (x = 0; x < VEC_length (int, g->edge_list); x += 2)
300 if (VEC_index (int, g->edge_list, x) == node)
302 VEC_replace (int, g->edge_list, x, -1);
303 y = VEC_index (int, g->edge_list, x + 1);
304 VEC_replace (int, g->edge_list, x + 1, -1);
319 for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2) \
321 y_ = VEC_index (int, (GRAPH)->edge_list, x_); \
324 (VAR) = VEC_index (int, (GRAPH)->edge_list, x_ + 1); \
338 for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2) \
340 y_ = VEC_index (int, (GRAPH)->edge_list, x_ + 1); \
343 (VAR) = VEC_index (int, (GRAPH)->edge_list, x_); \