Boost logo

Boost-Commit :

Subject: [Boost-commit] svn:boost r53271 - trunk/libs/graph_parallel/test
From: ngedmond_at_[hidden]
Date: 2009-05-25 23:00:43


Author: ngedmond
Date: 2009-05-25 23:00:42 EDT (Mon, 25 May 2009)
New Revision: 53271
URL: http://svn.boost.org/trac/boost/changeset/53271

Log:
Added "edges_are_sorted" to CSR test case

Text files modified:
   trunk/libs/graph_parallel/test/distributed_betweenness_centrality_test.cpp | 7 ++++---
   1 files changed, 4 insertions(+), 3 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-05-25 23:00:42 EDT (Mon, 25 May 2009)
@@ -96,7 +96,9 @@
 typedef int weight_type;
 
 struct WeightedEdge {
- WeightedEdge(weight_type weight = 0) : weight(weight) { }
+ WeightedEdge(weight_type weight = 1) : weight(weight) { }
+
+ void operator=(weight_type x) { weight = x; }
   
   weight_type weight;
 
@@ -128,7 +130,6 @@
                          property<edge_weight_t, int> > seqGraph;
 #endif
 
-
   typedef sorted_erdos_renyi_iterator<minstd_rand, Graph> ERIter;
 
   typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
@@ -151,7 +152,7 @@
 
   gen.seed(1); // Re-seed PRNG so we get the same graph
 
- seqGraph sg(ERIter(gen, n, prob), ERIter(),
+ seqGraph sg(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