Subject: [Boost-commit] svn:boost r53656 - trunk/boost/graph
From: jewillco_at_[hidden]
Date: 2009-06-05 16:09:24
Author: jewillco
Date: 2009-06-05 16:09:23 EDT (Fri, 05 Jun 2009)
New Revision: 53656
URL: http://svn.boost.org/trac/boost/changeset/53656
Log:
Changed to shared_array_property_map
Text files modified:
trunk/boost/graph/johnson_all_pairs_shortest.hpp | 5 ++---
1 files changed, 2 insertions(+), 3 deletions(-)
Modified: trunk/boost/graph/johnson_all_pairs_shortest.hpp
==============================================================================
--- trunk/boost/graph/johnson_all_pairs_shortest.hpp (original)
+++ trunk/boost/graph/johnson_all_pairs_shortest.hpp 2009-06-05 16:09:23 EDT (Fri, 05 Jun 2009)
@@ -24,6 +24,7 @@
#include <boost/graph/graph_traits.hpp>
#include <boost/property_map/property_map.hpp>
+#include <boost/property_map/shared_array_property_map.hpp>
#include <boost/graph/bellman_ford_shortest_paths.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/adjacency_list.hpp>
@@ -94,9 +95,7 @@
}
typename Traits2::vertex_iterator v, v_end, u, u_end;
typename Traits2::edge_iterator e, e_end;
- std::vector<DT> h_vec(num_vertices(g2));
- typedef typename std::vector<DT>::iterator iter_t;
- iterator_property_map<iter_t,VertexID2,DT,DT&> h(h_vec.begin(), id2);
+ shared_array_property_map<DT,VertexID2> h(num_vertices(g2), id2);
for (tie(v, v_end) = vertices(g2); v != v_end; ++v)
put(d, *v, inf);