[Boost-commit] svn:boost r52273 - trunk/boost/graph

Subject: [Boost-commit] svn:boost r52273 - trunk/boost/graph
From: jewillco_at_[hidden]
Date: 2009-04-08 20:48:36

Author: jewillco
Date: 2009-04-08 20:48:35 EDT (Wed, 08 Apr 2009)
New Revision: 52273
URL: http://svn.boost.org/trac/boost/changeset/52273

Log:
Changed some uses of operator[] to get() to reduce property map requirements
Text files modified: 
   trunk/boost/graph/johnson_all_pairs_shortest.hpp |     6 +++---                                  
   1 files changed, 3 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-04-08 20:48:35 EDT (Wed, 08 Apr 2009)
@@ -99,7 +99,7 @@
     iterator_property_map<iter_t,VertexID2,DT,DT&> h(h_vec.begin(), id2);
 
     for (tie(v, v_end) = vertices(g2); v != v_end; ++v)
-      d[*v] = inf;
+      put(d, *v, inf);
 
     put(d, s, zero);
     // Using the non-named parameter versions of bellman_ford and
@@ -122,8 +122,8 @@
         for (tie(v, v_end) = vertices(g2); v != v_end; ++v) {
           if (*u != s && *v != s) {
             typename Traits1::vertex_descriptor u1, v1;
-            u1 = verts1[id2[*u]]; v1 = verts1[id2[*v]];
-            D[id2[*u]-1][id2[*v]-1] = combine(get(d, *v), (get(h, *v) - get(h, *u)));
+            u1 = verts1[get(id2, *u)]; v1 = verts1[get(id2, *v)];
+            D[get(id2, *u)-1][get(id2, *v)-1] = combine(get(d, *v), (get(h, *v) - get(h, *u)));
           }
         }
       }