| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 86 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
90 BOOST_REQUIRE((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
104 if (random_real_dist() <= edge_probability) { in generate_random_digraph()
174 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
186 generate_random_digraph(g2, edge_probability, max_parallel_edges, parallel_edge_probability, in test_vf2_sub_graph_iso()
252 double edge_probability = 0.4; in test_main() local
268 edge_probability = boost::lexical_cast<double>(argv[3]); in test_main()
291 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in test_main()
|
| H A D | isomorphism.cpp | 78 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
90 if (random_dist() <= edge_probability) in generate_random_digraph()
154 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
162 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 86 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
90 BOOST_REQUIRE((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
104 if (random_real_dist() <= edge_probability) { in generate_random_digraph()
174 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
186 generate_random_digraph(g2, edge_probability, max_parallel_edges, parallel_edge_probability, in test_vf2_sub_graph_iso()
252 double edge_probability = 0.4; in test_main() local
268 edge_probability = boost::lexical_cast<double>(argv[3]); in test_main()
291 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in test_main()
|
| H A D | isomorphism.cpp | 78 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
90 if (random_dist() <= edge_probability) in generate_random_digraph()
154 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
162 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 86 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
90 BOOST_REQUIRE((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
104 if (random_real_dist() <= edge_probability) { in generate_random_digraph()
174 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
186 generate_random_digraph(g2, edge_probability, max_parallel_edges, parallel_edge_probability, in test_vf2_sub_graph_iso()
252 double edge_probability = 0.4; in test_main() local
268 edge_probability = boost::lexical_cast<double>(argv[3]); in test_main()
291 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in test_main()
|
| H A D | isomorphism.cpp | 78 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
90 if (random_dist() <= edge_probability) in generate_random_digraph()
154 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
162 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 86 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
90 BOOST_REQUIRE((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
104 if (random_real_dist() <= edge_probability) { in generate_random_digraph()
174 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
186 generate_random_digraph(g2, edge_probability, max_parallel_edges, parallel_edge_probability, in test_vf2_sub_graph_iso()
252 double edge_probability = 0.4; in test_main() local
268 edge_probability = boost::lexical_cast<double>(argv[3]); in test_main()
291 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in test_main()
|
| H A D | isomorphism.cpp | 78 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
90 if (random_dist() <= edge_probability) in generate_random_digraph()
154 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
162 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 86 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
90 BOOST_REQUIRE((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
104 if (random_real_dist() <= edge_probability) { in generate_random_digraph()
174 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
186 generate_random_digraph(g2, edge_probability, max_parallel_edges, parallel_edge_probability, in test_vf2_sub_graph_iso()
252 double edge_probability = 0.4; in test_main() local
268 edge_probability = boost::lexical_cast<double>(argv[3]); in test_main()
291 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in test_main()
|
| H A D | isomorphism.cpp | 78 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
90 if (random_dist() <= edge_probability) in generate_random_digraph()
154 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
162 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 99 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
103 BOOST_REQUIRE((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
117 if (random_real_dist() <= edge_probability) { in generate_random_digraph()
204 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
216 generate_random_digraph(g2, edge_probability, max_parallel_edges, parallel_edge_probability, in test_vf2_sub_graph_iso()
287 double edge_probability = 0.4; in test_main() local
303 edge_probability = boost::lexical_cast<double>(argv[3]); in test_main()
326 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in test_main()
|
| H A D | isomorphism.cpp | 94 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
106 if (random_dist() <= edge_probability) in generate_random_digraph()
171 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
179 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| H A D | betweenness_centrality_test.cpp | 238 void randomly_add_edges(MutableGraph& g, double edge_probability) in randomly_add_edges() argument
255 if (rand_gen() < edge_probability) add_edge(v, w, g); in randomly_add_edges()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 99 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
103 BOOST_REQUIRE((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
117 if (random_real_dist() <= edge_probability) { in generate_random_digraph()
204 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
216 generate_random_digraph(g2, edge_probability, max_parallel_edges, parallel_edge_probability, in test_vf2_sub_graph_iso()
287 double edge_probability = 0.4; in test_main() local
303 edge_probability = boost::lexical_cast<double>(argv[3]); in test_main()
326 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in test_main()
|
| H A D | isomorphism.cpp | 94 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
106 if (random_dist() <= edge_probability) in generate_random_digraph()
171 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
179 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 99 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
103 BOOST_REQUIRE((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
117 if (random_real_dist() <= edge_probability) { in generate_random_digraph()
204 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
216 generate_random_digraph(g2, edge_probability, max_parallel_edges, parallel_edge_probability, in test_vf2_sub_graph_iso()
287 double edge_probability = 0.4; in test_main() local
303 edge_probability = boost::lexical_cast<double>(argv[3]); in test_main()
326 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in test_main()
|
| H A D | isomorphism.cpp | 94 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
106 if (random_dist() <= edge_probability) in generate_random_digraph()
171 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
179 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/test/ |
| H A D | vf2_sub_graph_iso_test.cpp | 106 void generate_random_digraph(Graph& g, double edge_probability, in generate_random_digraph() argument
111 BOOST_TEST((0 <= edge_probability) && (edge_probability <= 1)); in generate_random_digraph()
130 if (random_real_dist() <= edge_probability) in generate_random_digraph()
231 void test_vf2_sub_graph_iso(int n1, int n2, double edge_probability, in test_vf2_sub_graph_iso() argument
249 generate_random_digraph(g2, edge_probability, max_parallel_edges, in test_vf2_sub_graph_iso()
324 double edge_probability = 0.4; in main() local
343 edge_probability = boost::lexical_cast< double >(argv[3]); in main()
371 test_vf2_sub_graph_iso(num_vertices_g1, num_vertices_g2, edge_probability, in main()
|
| H A D | isomorphism.cpp | 99 void generate_random_digraph(Graph& g, double edge_probability) in generate_random_digraph() argument
114 if (random_dist() <= edge_probability) in generate_random_digraph()
184 void test_isomorphism(int n, double edge_probability) in test_isomorphism() argument
193 generate_random_digraph(g1, edge_probability); in test_isomorphism()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/signals/test/ |
| H A D | random_signal_system.cpp | 313 void randomly_create_connections(minstd_rand& rand_gen, double edge_probability) in randomly_create_connections() argument
321 if (random() < edge_probability) { in randomly_create_connections()
354 double edge_probability = atof(argv[2]); in test_main() local
365 std::cout << "Edge probability: " << edge_probability << std::endl; in test_main()
380 randomly_create_connections(rand_gen, edge_probability); in test_main()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/signals/test/ |
| H A D | random_signal_system.cpp | 313 void randomly_create_connections(minstd_rand& rand_gen, double edge_probability) in randomly_create_connections() argument
321 if (random() < edge_probability) { in randomly_create_connections()
354 double edge_probability = atof(argv[2]); in test_main() local
365 std::cout << "Edge probability: " << edge_probability << std::endl; in test_main()
380 randomly_create_connections(rand_gen, edge_probability); in test_main()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/signals/test/ |
| H A D | random_signal_system.cpp | 313 void randomly_create_connections(minstd_rand& rand_gen, double edge_probability) in randomly_create_connections() argument
321 if (random() < edge_probability) { in randomly_create_connections()
354 double edge_probability = atof(argv[2]); in test_main() local
365 std::cout << "Edge probability: " << edge_probability << std::endl; in test_main()
380 randomly_create_connections(rand_gen, edge_probability); in test_main()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/signals/test/ |
| H A D | random_signal_system.cpp | 313 void randomly_create_connections(minstd_rand& rand_gen, double edge_probability) in randomly_create_connections() argument
321 if (random() < edge_probability) { in randomly_create_connections()
354 double edge_probability = atof(argv[2]); in test_main() local
365 std::cout << "Edge probability: " << edge_probability << std::endl; in test_main()
380 randomly_create_connections(rand_gen, edge_probability); in test_main()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/signals/test/ |
| H A D | random_signal_system.cpp | 313 void randomly_create_connections(minstd_rand& rand_gen, double edge_probability) in randomly_create_connections() argument
321 if (random() < edge_probability) { in randomly_create_connections()
354 double edge_probability = atof(argv[2]); in test_main() local
365 std::cout << "Edge probability: " << edge_probability << std::endl; in test_main()
380 randomly_create_connections(rand_gen, edge_probability); in test_main()
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/math_opt/samples/ |
| H A D | facility_lp_benders.cc | 38 ABSL_FLAG(double, edge_probability, 0.99, "Edge probability.");
64 Network(int num_facilities, int num_locations, double edge_probability);
94 const double edge_probability) { in Network() argument
105 if (absl::Bernoulli(bitgen, edge_probability)) { in Network()
|