|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r56859 - trunk/libs/graph_parallel/test
From: ngedmond_at_[hidden]
Date: 2009-10-14 22:44:25
Author: ngedmond
Date: 2009-10-14 22:44:24 EDT (Wed, 14 Oct 2009)
New Revision: 56859
URL: http://svn.boost.org/trac/boost/changeset/56859
Log:
Added edges_are_sorted tag to distributed CSR graph ctor since passing a sorted iterator range to the unsorted ctor seems to produce a different graph than passing a sorted iterator range to the sorted ctor.
Text files modified:
trunk/libs/graph_parallel/test/distributed_betweenness_centrality_test.cpp | 2 +-
1 files changed, 1 insertions(+), 1 deletions(-)
Modified: trunk/libs/graph_parallel/test/distributed_betweenness_centrality_test.cpp
==============================================================================
--- trunk/libs/graph_parallel/test/distributed_betweenness_centrality_test.cpp (original)
+++ trunk/libs/graph_parallel/test/distributed_betweenness_centrality_test.cpp 2009-10-14 22:44:24 EDT (Wed, 14 Oct 2009)
@@ -145,7 +145,7 @@
// NOTE: Weighted betweenness centrality only works with non-zero edge weights
// Build graphs
- Graph g(ERIter(gen, n, prob), ERIter(),
+ Graph g(edges_are_sorted, ERIter(gen, n, prob), ERIter(),
make_generator_iterator(gen, uniform_int<int>(1, C)),
n);
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk