Searched refs:sorted_erdos_renyi_iterator (Results 1 – 9 of 9) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | erdos_renyi_generator.hpp | 103 class sorted_erdos_renyi_iterator class
104 : public iterator_facade< sorted_erdos_renyi_iterator< RandomGenerator, Graph >,
121 sorted_erdos_renyi_iterator() in sorted_erdos_renyi_iterator() function in boost::sorted_erdos_renyi_iterator
135 sorted_erdos_renyi_iterator(RandomGenerator& gen, vertices_size_type n, in sorted_erdos_renyi_iterator() function in boost::sorted_erdos_renyi_iterator
161 bool equal(const sorted_erdos_renyi_iterator& o) const in equal()
|
| /third_party/boost/libs/graph/test/ |
| D | generator_test.cpp | 48 sorted_erdos_renyi_iterator< RandomGenerator, Graph > start(gen, N, p); in main()
49 sorted_erdos_renyi_iterator< RandomGenerator, Graph > end; in main()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_strong_components_test.cpp | 87 Graph g(sorted_erdos_renyi_iterator<minstd_rand, Graph>(gen, n, _p/2), in test_distributed_strong_components()
88 sorted_erdos_renyi_iterator<minstd_rand, Graph>(), in test_distributed_strong_components()
|
| D | distributed_csr_test.cpp | 90 typedef sorted_erdos_renyi_iterator<minstd_rand, Digraph> ERIter; in test_main()
|
| D | algorithm_performance.cpp | 421 Graph g(sorted_erdos_renyi_iterator<RandomGenerator, Graph>(gen, N, _p/2), in test_csr()
422 sorted_erdos_renyi_iterator<RandomGenerator, Graph>(), in test_csr()
434 sorted_erdos_renyi_iterator<RandomGenerator, seqGraph>(gen, N, _p/2), in test_csr()
435 sorted_erdos_renyi_iterator<RandomGenerator, seqGraph>(), in test_csr()
|
| D | distributed_betweenness_centrality_test.cpp | 132 typedef sorted_erdos_renyi_iterator<minstd_rand, Graph> ERIter; in test_main()
|
| D | distributed_csr_algorithm_test.cpp | 223 typedef sorted_erdos_renyi_iterator<minstd_rand, Digraph> ERIter; in test_main()
|
| /third_party/boost/libs/mpi/test/ |
| D | graph_topology_test.cpp | 70 sorted_erdos_renyi_iterator<minstd_rand, Graph> in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | distributed_adjacency_list.rst | 255 typedef boost::sorted_erdos_renyi_iterator<boost::minstd_rand, Graph> ERIter;
|