Searched refs:num_vertices (Results 1 - 3 of 3) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/pb_ds/example/
H A Dpriority_queue_dijkstra.cc82 num_vertices = 5, enumerator in enum:__anon2471
90 const size_t a_a_edge_legnth[num_vertices][num_vertices] =
113 for (size_t i = 0; i < num_vertices; ++i)
136 for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i)
/haiku-buildtools/gcc/gcc/
H A Dmcf.c121 int num_vertices; member in struct:fixup_graph_d
293 fnum_vertices = fixup_graph->num_vertices;
431 gcc_assert (src < fixup_graph->num_vertices);
450 int fnum_vertices = fixup_graph->num_vertices;
506 fixup_graph->num_vertices = n_basic_blocks_for_fn (cfun);
544 fixup_graph->num_vertices++;
560 gcc_assert (fixup_graph->num_vertices == fnum_vertices_after_transform);
602 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices;
603 fixup_graph->num_vertices++;
609 new_exit_index = fixup_graph->new_exit_index = fixup_graph->num_vertices;
[all...]
H A Dgraphite-sese-to-poly.c1740 int num_vertices = drs.length (); variable
1741 struct graph *g = new_graph (num_vertices);
1760 all_vertices = XNEWVEC (int, num_vertices);
1761 vertices = XNEWVEC (int, num_vertices);
1762 for (i = 0; i < num_vertices; i++)
1765 num_connected_components = graphds_dfs (g, all_vertices, num_vertices,
1784 for (j = 0; j < num_vertices; j++)

Completed in 127 milliseconds