Searched refs:v_order (Results 1 – 1 of 1) sorted by relevance
256 int v_order; /* (g) order of vertex in graph */ member2064 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()[all …]