$include_dir="/home/hyper-archives/boost-commit/include"; include("$include_dir/msg-header.inc") ?>
Subject: [Boost-commit] svn:boost r53284 - trunk/boost/graph
From: jewillco_at_[hidden]
Date: 2009-05-26 12:11:27
Author: jewillco
Date: 2009-05-26 12:11:25 EDT (Tue, 26 May 2009)
New Revision: 53284
URL: http://svn.boost.org/trac/boost/changeset/53284
Log:
Fixed bad syntax
Text files modified: 
   trunk/boost/graph/dijkstra_shortest_paths_no_color_map.hpp |     2 +-                                      
   1 files changed, 1 insertions(+), 1 deletions(-)
Modified: trunk/boost/graph/dijkstra_shortest_paths_no_color_map.hpp
==============================================================================
--- trunk/boost/graph/dijkstra_shortest_paths_no_color_map.hpp	(original)
+++ trunk/boost/graph/dijkstra_shortest_paths_no_color_map.hpp	2009-05-26 12:11:25 EDT (Tue, 26 May 2009)
@@ -107,7 +107,7 @@
     // Examine neighbors of min_vertex
     typedef typename graph_traits<Graph>::edge_descriptor Edge;
     typename graph_traits<Graph>::out_edge_iterator edge_iter, edge_iter_end;
-    BGL_FORALL_OUT_EDGES_T(current_edge, min_vertex, graph, Graph) {
+    BGL_FORALL_OUTEDGES_T(min_vertex, current_edge, graph, Graph) {
       visitor.examine_edge(current_edge, graph);
       
       // Check if the edge has a negative weight