[Boost-commit] svn:boost r53396 - trunk/libs/graph/test

Subject: [Boost-commit] svn:boost r53396 - trunk/libs/graph/test
From: jewillco_at_[hidden]
Date: 2009-05-29 12:52:58

Author: jewillco
Date: 2009-05-29 12:52:58 EDT (Fri, 29 May 2009)
New Revision: 53396
URL: http://svn.boost.org/trac/boost/changeset/53396

Log:
Added patch from Michael Hansen
Text files modified: 
   trunk/libs/graph/test/dijkstra_cc.cpp |    22 ++++++++++++++++++++++                  
   1 files changed, 22 insertions(+), 0 deletions(-)

Modified: trunk/libs/graph/test/dijkstra_cc.cpp
==============================================================================
--- trunk/libs/graph/test/dijkstra_cc.cpp	(original)
+++ trunk/libs/graph/test/dijkstra_cc.cpp	2009-05-29 12:52:58 EDT (Fri, 29 May 2009)
@@ -10,6 +10,7 @@
 #include <boost/config.hpp>
 #include <boost/concept_archetype.hpp>
 #include <boost/graph/dijkstra_shortest_paths.hpp>
+#include <boost/graph/dijkstra_shortest_paths_no_color_map.hpp>
 #include <boost/graph/graph_archetypes.hpp>
 
 typedef boost::default_constructible_archetype<
@@ -50,6 +51,11 @@
                             vertex_index_map(index).
                             weight_map(weight).
                             distance_map(distance));
+
+    dijkstra_shortest_paths_no_color_map(g, s, 
+                                         vertex_index_map(index).
+                                         weight_map(weight).
+                                         distance_map(distance));
   }
   {
     typedef incidence_graph_archetype<vertex_t, directed_tag, 
@@ -66,6 +72,10 @@
     dijkstra_shortest_paths(g, s,
                             predecessor_map(pred).
                             weight_map(weight));
+
+    dijkstra_shortest_paths_no_color_map(g, s,
+                                         predecessor_map(pred).
+                                         weight_map(weight));
   }
   {
     typedef incidence_graph_archetype<vertex_t, directed_tag, 
@@ -81,6 +91,10 @@
     dijkstra_shortest_paths(g, s,
                             predecessor_map(pred).
                             vertex_index_map(index));
+
+     dijkstra_shortest_paths_no_color_map(g, s,
+                                          predecessor_map(pred).
+                                          vertex_index_map(index));
   }
   {
     typedef incidence_graph_archetype<vertex_t, directed_tag, 
@@ -109,6 +123,14 @@
                             distance_combine(combine).
                             distance_compare(compare).
                             visitor(vis));
+
+    dijkstra_shortest_paths_no_color_map(g, s,
+                                         vertex_index_map(index).
+                                         weight_map(weight).
+                                         distance_map(distance).
+                                         distance_combine(combine).
+                                         distance_compare(compare).
+                                         visitor(vis));
   }
   return 0;
 }