[Boost-commit] svn:boost r74094 - in trunk: boost/graph libs/graph_parallel/example

Subject: [Boost-commit] svn:boost r74094 - in trunk: boost/graph libs/graph_parallel/example
From: jewillco_at_[hidden]
Date: 2011-08-27 15:35:05

Author: jewillco
Date: 2011-08-27 15:35:05 EDT (Sat, 27 Aug 2011)
New Revision: 74094
URL: http://svn.boost.org/trac/boost/changeset/74094

Log:
Fixed inspection report issues
Text files modified: 
   trunk/boost/graph/subgraph.hpp                             |     3 ++-                                     
   trunk/libs/graph_parallel/example/breadth_first_search.cpp |     2 +-                                      
   2 files changed, 3 insertions(+), 2 deletions(-)

Modified: trunk/boost/graph/subgraph.hpp
==============================================================================
--- trunk/boost/graph/subgraph.hpp	(original)
+++ trunk/boost/graph/subgraph.hpp	2011-08-27 15:35:05 EDT (Sat, 27 Aug 2011)
@@ -23,6 +23,7 @@
 #include <boost/iterator/indirect_iterator.hpp>
 
 #include <boost/static_assert.hpp>
+#include <boost/assert.hpp>
 #include <boost/type_traits/is_same.hpp>
 
 namespace boost {
@@ -665,7 +666,7 @@
     typename subgraph<G>::edge_descriptor e_global = g.local_to_global(e);
 #ifndef NDEBUG
     std::pair<typename subgraph<G>::edge_descriptor, bool> fe = g.find_edge(e_global);
-    assert(fe.second && fe.first == e);
+    BOOST_ASSERT(fe.second && fe.first == e);
 #endif //NDEBUG
     subgraph<G> &root = g.root(); // chase to root
     detail::children_remove_edge<G>(e_global, root.m_children);

Modified: trunk/libs/graph_parallel/example/breadth_first_search.cpp
==============================================================================
--- trunk/libs/graph_parallel/example/breadth_first_search.cpp	(original)
+++ trunk/libs/graph_parallel/example/breadth_first_search.cpp	2011-08-27 15:35:05 EDT (Sat, 27 Aug 2011)
@@ -76,7 +76,7 @@
 
   // Initialize distances to infinity and set reduction operation to 'min'
   BGL_FORALL_VERTICES(v, g, Graph) {
-    put(distance, v, std::numeric_limits<std::size_t>::max());
+    put(distance, v, (std::numeric_limits<std::size_t>::max)());
   }
   distance.set_reduce(boost::graph::distributed::choose_min_reducer<std::size_t>());