boost/graph_parallel
2
0
Fork 0
mirror of https://github.com/boostorg/graph_parallel.git synced 2026-01-26 18:42:12 +00:00
Code Issues Projects Releases Wiki Activity

Applied changes r58876, r59133, r59134, r59628, r60078, r60079, r60126, r60127, r60196, r60197, r60198, r60365, r60366, r60384, r60385, r60472, r60485, r60610, r60611, r60651, r60769, r60770, r60899, r60900, r60916, r60919, r60920, r60958, r60998, r60999, r61000 from trunk, except for changes to <boost/detail/algorithm.hpp> which are waiting for Boost.Range algorithms to be merged; added find_if to <boost/detail/algorithm.hpp>

Browse Source 
[SVN r61001]
This commit is contained in:
Jeremiah Willcock
2010-04-02 15:25:11 +00:00
parent 2ab5b862fb
commit 8c52a17322
4 changed files with 122 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
test/distributed_csr_algorithm_test.cpp
View File

@@ -243,7 +243,7 @@ int test_main(int argc, char* argv[])
make_generator_iterator(gen, uniform_int<int>(0, C)),
n);
Digraph g2(SWIter(gen, n, k, prob), SWIter(), n);
Digraph g3(RMATIter(gen, n, (n*n*prob), a, b, c, d), RMATIter(), n);
Digraph g3(RMATIter(gen, n, size_t(n*n*prob), a, b, c, d), RMATIter(), n);
// Test BFS
breadth_first_search(g, vertex(0, g), visitor(bfs_visitor<>()));