| /third_party/boost/libs/graph/example/ |
| D | bellman-ford-internet.cpp | 26 n_vertices in main() enumerator
47 int parent[n_vertices]; in main()
48 for (int i = 0; i < n_vertices; ++i) in main()
50 float distance[n_vertices]; in main()
52 distance, distance + n_vertices, (std::numeric_limits< float >::max)()); in main()
56 bool r = bellman_ford_shortest_paths(g, int(n_vertices), in main()
63 for (int i = 0; i < n_vertices; ++i) in main()
|
| D | default-constructor2.cpp | 18 size_type n_vertices; in read_graph_file() local
19 in >> n_vertices; // read in number of vertices in read_graph_file()
20 std::vector< Vertex > vertex_set(n_vertices); in read_graph_file()
21 for (size_type i = 0; i < n_vertices; ++i) in read_graph_file()
|
| D | default-constructor.cpp | 17 size_type n_vertices; in read_graph_file() local
18 in >> n_vertices; // read in number of vertices in read_graph_file()
19 for (size_type i = 0; i < n_vertices; ++i) // Add n vertices to the graph in read_graph_file()
|
| D | edge-iter-constructor.cpp | 33 size_type n_vertices; in main() local
34 file_in >> n_vertices; // read in number of vertices in main()
36 graph_type g(n_vertices); // create graph with n vertices in main()
|
| D | cycle-file-dep.cpp | 68 size_type n_vertices; in main() local
69 file_in >> n_vertices; // read in number of vertices in main()
75 file_dep_graph g(n_vertices); in main()
83 file_dep_graph g(input_begin, input_end, n_vertices); in main()
|
| D | topo-sort-file-dep.cpp | 61 size_type n_vertices; in main() local
62 file_in >> n_vertices; // read in number of vertices in main()
68 file_dep_graph g(n_vertices); in main()
76 file_dep_graph g(input_begin, input_end, n_vertices); in main()
|
| D | accum-compile-times.cpp | 57 size_type n_vertices; in main() local
58 file_in >> n_vertices; // read in number of vertices in main()
63 for (std::size_t i = 0; i < n_vertices; ++i) in main()
72 file_dep_graph2 g(input_begin, input_end, n_vertices); in main()
|
| D | weighted_matching_example.cpp | 26 const int n_vertices = 18; in main() local
27 my_graph g(n_vertices); in main()
80 n_vertices), in main()
81 mate2(n_vertices); in main()
|
| D | vertex-name-property.cpp | 21 size_type n_vertices; in read_graph_file() local
25 graph_in >> n_vertices; // read in number of vertices in read_graph_file()
26 for (size_type i = 0; i < n_vertices; ++i) in read_graph_file()
|
| D | cycle-file-dep2.cpp | 107 size_type n_vertices; in main() local
108 file_in >> n_vertices; // read in number of vertices in main()
114 file_dep_graph g(n_vertices); in main()
122 file_dep_graph g(input_begin, input_end, n_vertices); in main()
|
| D | topo-sort-file-dep2.cpp | 103 size_type n_vertices; in main() local
104 file_in >> n_vertices; // read in number of vertices in main()
111 file_dep_graph g(n_vertices); in main()
119 file_dep_graph g(input_begin, input_end, n_vertices); in main()
|
| D | print-edges.cpp | 21 size_type n_vertices; in read_graph_file() local
25 graph_in >> n_vertices; // read in number of vertices in read_graph_file()
26 for (size_type i = 0; i < n_vertices; ++i) in read_graph_file()
|
| D | last-mod-time.cpp | 40 size_type n_vertices; in read_graph_file() local
44 graph_in >> n_vertices; // read in number of vertices in read_graph_file()
45 for (size_type i = 0; i < n_vertices; ++i) in read_graph_file()
|
| D | print-adjacent-vertices.cpp | 21 size_type n_vertices; in read_graph_file() local
25 graph_in >> n_vertices; // read in number of vertices in read_graph_file()
26 for (size_type i = 0; i < n_vertices; ++i) in read_graph_file()
|
| D | print-in-edges.cpp | 21 size_type n_vertices; in read_graph_file() local
25 graph_in >> n_vertices; // read in number of vertices in read_graph_file()
26 for (size_type i = 0; i < n_vertices; ++i) in read_graph_file()
|
| /third_party/vk-gl-cts/external/openglcts/modules/glesext/tessellation_shader/ |
| D | esextcTessellationShaderInvariance.hpp | 231 unsigned int n_vertices; member
241 n_vertices = 0; in _test_iteration()
314 unsigned int n_vertices; member
324 n_vertices = 0; in _test_iteration()
335 …bool isVertexDefined(const float* vertex_data, unsigned int n_vertices, const float* vertex_data_s…
381 unsigned int n_vertices; member
391 n_vertices = 0; in _test_iteration()
402 …bool isVertexDefined(const float* vertex_data, unsigned int n_vertices, const float* vertex_data_s…
448 unsigned int n_vertices; member
458 n_vertices = 0; in _test_iteration()
[all …]
|
| D | esextcTessellationShaderQuads.hpp | 93 unsigned int n_vertices; member
100 n_vertices = 0; in _run()
175 unsigned int n_vertices; member
184 n_vertices = 0; in _run()
|
| D | esextcTessellationShaderInvariance.cpp | 881 unsigned int n_vertices = 0; in verifyResultData() local
890 n_vertices = n_line_vertices; in verifyResultData()
900 n_vertices = n_point_vertices; in verifyResultData()
910 n_vertices = n_tri_vertices; in verifyResultData()
923 unsigned int zero_bo_size = vertex_size * n_vertices; in verifyResultData()
924 char* zero_bo_data = new char[vertex_size * n_vertices]; in verifyResultData()
939 if (memcmp(data1_ptr, data2_ptr, vertex_size * n_vertices) != 0) in verifyResultData()
945 for (unsigned int n_vertex = 0; n_vertex < n_vertices; ++n_vertex) in verifyResultData()
949 if (n_vertex != (n_vertices - 1)) in verifyResultData()
961 for (unsigned int n_vertex = 0; n_vertex < n_vertices; ++n_vertex) in verifyResultData()
[all …]
|
| D | esextcTessellationShaderTriangles.hpp | 164 unsigned int n_vertices; member
173 n_vertices = 0; in _run()
238 unsigned int n_vertices; member
247 n_vertices = 0; in _run()
|
| D | esextcTessellationShaderQuads.cpp | 167 run.n_vertices = m_utils->getAmountOfVerticesGeneratedByTessellator( in initTest()
171 if (run.n_vertices == 0) in initTest()
236 if (run.n_vertices != (2 /* triangles */ * 3 /* vertices */)) in iterate()
240 … m_testCtx.getLog() << tcu::TestLog::Message << "Invalid number of coordinates (" << run.n_vertices in iterate()
260 …for (unsigned int n_triangle = 0; n_triangle < base_run.n_vertices / 3 /* vertices per triangle */… in iterate()
567 run.n_vertices = n_set1_vertices; in initTest()
614 const glw::GLint n_triangles = run.n_vertices / 3 /* vertices per triangle */; in iterate()
702 getUniqueTessCoordinatesFromVertexDataSet((const float*)(&run.set1_data[0]), run.n_vertices); in iterate()
765 DE_ASSERT((run.n_vertices % 3) == 0); in iterate()
767 for (unsigned int n_triangle = 0; n_triangle < run.n_vertices / 3; ++n_triangle) in iterate()
[all …]
|
| D | esextcTessellationShaderIsolines.cpp | 76 if (test_result.n_vertices != 0) in checkFirstOuterTessellationLevelEffect()
173 DE_ASSERT(test_result.n_vertices == test_result_reference.n_vertices); in checkIrrelevantTessellationLevelsHaveNoEffect()
175 for (unsigned int n_vertex = 0; n_vertex < test_result.n_vertices; ++n_vertex) in checkIrrelevantTessellationLevelsHaveNoEffect()
246 if (test_result.n_vertices != 0) in checkSecondOuterTessellationLevelEffect()
260 for (unsigned int n_vertex = 0; n_vertex < test_result.n_vertices; in checkSecondOuterTessellationLevelEffect()
332 for (unsigned int n_vertex = 0; n_vertex < test_result.n_vertices; ++n_vertex) in checkNoLineSegmentIsDefinedAtHeightOne()
415 for (unsigned int n_vertex = 0; n_vertex < test_result.n_vertices; ++n_vertex) in countIsolines()
697 result.n_vertices = n_rendered_vertices; in iterate()
|
| /third_party/boost/boost/graph/ |
| D | dimacs.hpp | 156 inline vertices_size_type n_vertices() { return num_vertices; } in n_vertices() function in boost::graph::dimacs_basic_reader
276 if (reader.n_vertices() == 0) in operator ==()
280 else if (arg.reader.n_vertices() == 0) in operator ==()
293 if (reader.n_vertices() == 0) in operator !=()
297 else if (arg.reader.n_vertices() == 0) in operator !=()
336 if (reader.n_vertices() == 0) in operator ==()
340 else if (arg.reader.n_vertices() == 0) in operator ==()
353 if (reader.n_vertices() == 0) in operator !=()
357 else if (arg.reader.n_vertices() == 0) in operator !=()
|
| D | hawick_circuits.hpp | 156 VerticesSize n_vertices) in hawick_circuits_from()
162 , blocked_(n_vertices, vim_) in hawick_circuits_from()
170 BOOST_ASSERT(closed_.size() == n_vertices); in hawick_circuits_from()
309 VerticesSize const n_vertices = num_vertices(graph); in call_hawick_circuits() local
311 stack.reserve(n_vertices); in call_hawick_circuits()
312 ClosedMatrix closed(n_vertices); in call_hawick_circuits()
325 graph, visitor, vertex_index_map, stack, closed, n_vertices); in call_hawick_circuits()
|
| D | adjacency_matrix.hpp | 560 vertices_size_type n_vertices, const GraphProperty& p = GraphProperty()) in adjacency_matrix() argument
561 : m_matrix(Directed::is_directed ? (n_vertices * n_vertices) in adjacency_matrix()
562 : (n_vertices * (n_vertices + 1) / 2)) in adjacency_matrix()
563 , m_vertex_set(0, n_vertices) in adjacency_matrix()
564 , m_vertex_properties(n_vertices) in adjacency_matrix()
572 vertices_size_type n_vertices, const GraphProperty& p = GraphProperty()) in adjacency_matrix() argument
573 : m_matrix(Directed::is_directed ? (n_vertices * n_vertices) in adjacency_matrix()
574 : (n_vertices * (n_vertices + 1) / 2)) in adjacency_matrix()
575 , m_vertex_set(0, n_vertices) in adjacency_matrix()
576 , m_vertex_properties(n_vertices) in adjacency_matrix()
[all …]
|
| D | max_cardinality_matching.hpp | 151 , n_vertices(num_vertices(arg_g)) in edmonds_augmenting_path_finder()
154 mate_vector(n_vertices) in edmonds_augmenting_path_finder()
155 , ancestor_of_v_vector(n_vertices) in edmonds_augmenting_path_finder()
156 , ancestor_of_w_vector(n_vertices) in edmonds_augmenting_path_finder()
157 , vertex_state_vector(n_vertices) in edmonds_augmenting_path_finder()
158 , origin_vector(n_vertices) in edmonds_augmenting_path_finder()
159 , pred_vector(n_vertices) in edmonds_augmenting_path_finder()
160 , bridge_vector(n_vertices) in edmonds_augmenting_path_finder()
161 , ds_parent_vector(n_vertices) in edmonds_augmenting_path_finder()
162 , ds_rank_vector(n_vertices) in edmonds_augmenting_path_finder()
[all …]
|