Searched refs:num_v (Results 1 – 3 of 3) sorted by relevance
| /third_party/boost/libs/graph/test/ |
| D | weighted_matching_test.cpp | 118 Graph make_graph(typename graph_traits< Graph >::vertices_size_type num_v, in make_graph() argument
122 Graph g(num_v); in make_graph()
146 std::size_t answer, num_v, num_e; in main() local
147 in_graph >> answer >> num_v >> num_e; in main()
155 make_graph< undirected_graph >(num_v, num_e, input_edges), answer); in main()
157 make_graph< undirected_list_graph >(num_v, num_e, input_edges), in main()
160 num_v, num_e, input_edges), in main()
|
| D | matching_test.cpp | 121 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
132 const std::size_t double_num_v = num_v * 2; in matching_test()
201 && matching_size(g, edmonds_mate) == num_v; in matching_test()
216 && matching_size(g, greedy_mate) == num_v; in matching_test()
231 && matching_size(g, extra_greedy_mate) == num_v; in matching_test()
272 gabows_graph(h, num_v); in matching_test()
295 BOOST_TEST(matching_size(h, gabow_mate) == num_v); in matching_test()
296 if (gabows_graph_result && matching_size(h, gabow_mate) != num_v) in matching_test()
304 << " when it should be " << num_v << std::endl; in matching_test()
371 std::cout << graph_name << " passed all tests for n = " << num_v << '.' in matching_test()
|
| /third_party/mindspore/mindspore/ops/operations/ |
| D | math_ops.py | 5182 num_v = num['value']
5183 validator.check_value_type('num', num_v, [int], self.name)
5184 validator.check_positive_int(num_v, "num", self.name)
5185 out_shape = [num_v]
|