Searched refs:edge_probability (Results 1 – 5 of 5) sorted by relevance
| /third_party/boost/libs/graph/test/ |
| 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()
|
| 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()
|
| D | betweenness_centrality_test.cpp | 235 void randomly_add_edges(MutableGraph& g, double edge_probability) in randomly_add_edges() argument
257 if (rand_gen() < edge_probability) in randomly_add_edges()
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/gnn/ |
| D | graph_data_impl.h | 194 std::shared_ptr<StochasticIndex> *edge_probability);
|
| D | graph_data_impl.cc | 773 … std::shared_ptr<StochasticIndex> *edge_probability) { in GetEdgeProbability() argument
774 RETURN_UNEXPECTED_IF_NULL(edge_probability); in GetEdgeProbability()
805 *edge_probability = in GetEdgeProbability()
|