Lines Matching refs:v_order
256 int v_order; /* (g) order of vertex in graph */ member
2064 KASSERT(g->g_vertices[i]->v_order == i, in graph_check()
2085 printf("%d:", v->v_order); in graph_print_vertices()
2126 if (e->e_to->v_order < x->v_order in graph_delta_forward()
2165 if (e->e_from->v_order > y->v_order in graph_delta_backward()
2186 i > 0 && indices[i - 1] > v->v_order; i--) in graph_add_indices()
2190 indices[i] = v->v_order; in graph_add_indices()
2206 if (!vlowest || v->v_order < vlowest->v_order) in graph_assign_indices()
2210 vlowest->v_order = indices[nextunused]; in graph_assign_indices()
2211 g->g_vertices[vlowest->v_order] = vlowest; in graph_assign_indices()
2239 printf("adding edge %d:", x->v_order); in graph_add_edge()
2241 printf(" -> %d:", y->v_order); in graph_add_edge()
2246 if (y->v_order < x->v_order) { in graph_add_edge()
2336 KASSERT(x->v_order < y->v_order, ("Failed to re-order graph")); in graph_add_edge()
2376 printf("removing edge %d:", x->v_order); in graph_remove_edge()
2378 printf(" -> %d:", y->v_order); in graph_remove_edge()
2410 v->v_order = g->g_size; in graph_alloc_vertex()
2437 for (i = v->v_order + 1; i < g->g_size; i++) { in graph_free_vertex()
2439 w->v_order--; in graph_free_vertex()