Boost logo

Boost-Commit :

Subject: [Boost-commit] svn:boost r52336 - in trunk/boost/graph: . distributed
From: jewillco_at_[hidden]
Date: 2009-04-11 13:01:35


Author: jewillco
Date: 2009-04-11 13:01:34 EDT (Sat, 11 Apr 2009)
New Revision: 52336
URL: http://svn.boost.org/trac/boost/changeset/52336

Log:
Fixed inspection problems
Text files modified:
   trunk/boost/graph/distributed/betweenness_centrality.hpp | 34 +++++++++++++++++-----------------
   trunk/boost/graph/property_iter_range.hpp | 2 +-
   2 files changed, 18 insertions(+), 18 deletions(-)

Modified: trunk/boost/graph/distributed/betweenness_centrality.hpp
==============================================================================
--- trunk/boost/graph/distributed/betweenness_centrality.hpp (original)
+++ trunk/boost/graph/distributed/betweenness_centrality.hpp 2009-04-11 13:01:34 EDT (Sat, 11 Apr 2009)
@@ -1093,7 +1093,7 @@
            typename IncomingMap, typename DistanceMap,
            typename DependencyMap, typename PathCountMap,
            typename VertexIndexMap, typename ShortestPaths,
- typename Buffer>
+ typename Buffer>
   void
   non_distributed_brandes_betweenness_centrality_impl(const ProcessGroup& pg,
                                                       const Graph& g,
@@ -1134,16 +1134,16 @@
 
       for (int i = 0; i < id; ++i) if (!sources.empty()) sources.pop();
       while (!sources.empty()) {
- local_sources.push_back(sources.top());
+ local_sources.push_back(sources.top());
 
- for (int i = 0; i < p; ++i) if (!sources.empty()) sources.pop();
+ for (int i = 0; i < p; ++i) if (!sources.empty()) sources.pop();
       }
 
       // DO SSSPs
       for(int i = 0; i < local_sources.size(); ++i)
- do_sequential_brandes_sssp(g, centrality, edge_centrality_map, incoming,
- distance, dependency, path_count, vertex_index,
- shortest_paths, ordered_vertices, local_sources[i]);
+ do_sequential_brandes_sssp(g, centrality, edge_centrality_map, incoming,
+ distance, dependency, path_count, vertex_index,
+ shortest_paths, ordered_vertices, local_sources[i]);
 
     } else { // Exact Betweenness Centrality
       typedef typename graph_traits<Graph>::vertices_size_type vertices_size_type;
@@ -1431,9 +1431,9 @@
 }
   
 template<typename ProcessGroup, typename Graph, typename CentralityMap,
- typename EdgeCentralityMap, typename IncomingMap, typename DistanceMap,
+ typename EdgeCentralityMap, typename IncomingMap, typename DistanceMap,
          typename DependencyMap, typename PathCountMap, typename VertexIndexMap,
- typename Buffer>
+ typename Buffer>
 void
 non_distributed_brandes_betweenness_centrality(const ProcessGroup& pg,
                                                const Graph& g,
@@ -1461,9 +1461,9 @@
 }
   
 template<typename ProcessGroup, typename Graph, typename CentralityMap,
- typename EdgeCentralityMap, typename IncomingMap, typename DistanceMap,
+ typename EdgeCentralityMap, typename IncomingMap, typename DistanceMap,
          typename DependencyMap, typename PathCountMap, typename VertexIndexMap,
- typename WeightMap, typename Buffer>
+ typename WeightMap, typename Buffer>
 void
 non_distributed_brandes_betweenness_centrality(const ProcessGroup& pg,
                                                const Graph& g,
@@ -1491,7 +1491,7 @@
 namespace detail { namespace graph {
   template<typename ProcessGroup, typename Graph, typename CentralityMap,
            typename EdgeCentralityMap, typename WeightMap, typename VertexIndexMap,
- typename Buffer>
+ typename Buffer>
   void
   non_distributed_brandes_betweenness_centrality_dispatch2(const ProcessGroup& pg,
                                                            const Graph& g,
@@ -1599,7 +1599,7 @@
 template<typename ProcessGroup, typename Graph, typename Param, typename Tag, typename Rest>
 void
 non_distributed_brandes_betweenness_centrality(const ProcessGroup& pg, const Graph& g,
- const bgl_named_params<Param,Tag,Rest>& params)
+ const bgl_named_params<Param,Tag,Rest>& params)
 {
   typedef bgl_named_params<Param,Tag,Rest> named_params;
 
@@ -1622,7 +1622,7 @@
 template<typename ProcessGroup, typename Graph, typename CentralityMap>
 void
 non_distributed_brandes_betweenness_centrality(const ProcessGroup& pg, const Graph& g,
- CentralityMap centrality)
+ CentralityMap centrality)
 {
   typedef queue<int> queue_t;
   queue_t q;
@@ -1633,10 +1633,10 @@
 }
 
 template<typename ProcessGroup, typename Graph, typename CentralityMap,
- typename Buffer>
+ typename Buffer>
 void
 non_distributed_brandes_betweenness_centrality(const ProcessGroup& pg, const Graph& g,
- CentralityMap centrality, Buffer sources)
+ CentralityMap centrality, Buffer sources)
 {
   detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2(
     pg, g, centrality, dummy_property_map(), get(vertex_index, g), sources);
@@ -1646,9 +1646,9 @@
          typename EdgeCentralityMap, typename Buffer>
 void
 non_distributed_brandes_betweenness_centrality(const ProcessGroup& pg, const Graph& g,
- CentralityMap centrality,
+ CentralityMap centrality,
                                                EdgeCentralityMap edge_centrality_map,
- Buffer sources)
+ Buffer sources)
 {
   detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2(
     pg, g, centrality, edge_centrality_map, get(vertex_index, g), sources);

Modified: trunk/boost/graph/property_iter_range.hpp
==============================================================================
--- trunk/boost/graph/property_iter_range.hpp (original)
+++ trunk/boost/graph/property_iter_range.hpp 2009-04-11 13:01:34 EDT (Sat, 11 Apr 2009)
@@ -1,5 +1,5 @@
 
-// (C) Copyright François Faure, iMAGIS-GRAVIR / UJF, 2001.
+// (C) Copyright Francois Faure, iMAGIS-GRAVIR / UJF, 2001.
 //
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at


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