[Boost-commit] svn:boost r47237 - in sandbox/SOC/2008/graphs/trunk: boost/graphs libs/graphs

From: asutton_at_[hidden]
Date: 2008-07-08 12:54:36

Author: asutton
Date: 2008-07-08 12:54:36 EDT (Tue, 08 Jul 2008)
New Revision: 47237
URL: http://svn.boost.org/trac/boost/changeset/47237

Log:
Commented out part of the undirected graph to make it work.

Text files modified: 
   sandbox/SOC/2008/graphs/trunk/boost/graphs/undirected_graph.hpp |     2 ++                                      
   sandbox/SOC/2008/graphs/trunk/libs/graphs/un.cpp                |     4 ++--                                    
   2 files changed, 4 insertions(+), 2 deletions(-)

Modified: sandbox/SOC/2008/graphs/trunk/boost/graphs/undirected_graph.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/trunk/boost/graphs/undirected_graph.hpp	(original)
+++ sandbox/SOC/2008/graphs/trunk/boost/graphs/undirected_graph.hpp	2008-07-08 12:54:36 EDT (Tue, 08 Jul 2008)
@@ -489,6 +489,7 @@
 void
 undirected_graph<VP,EP,VS,ES>::remove_edges(vertex_descriptor v)
 {
+    /*
     // Disconnecting a vertex is not quite so simple as clearing the incidence
     // set since we have to remove all the edge properties and remove the
     // opposite edges from other vertices.
@@ -511,6 +512,7 @@
     // previous loop because we'll probably end up invalidating our own
     // iterators.
     src.clear();
+    */
 }
 
 /**

Modified: sandbox/SOC/2008/graphs/trunk/libs/graphs/un.cpp
==============================================================================
--- sandbox/SOC/2008/graphs/trunk/libs/graphs/un.cpp	(original)
+++ sandbox/SOC/2008/graphs/trunk/libs/graphs/un.cpp	2008-07-08 12:54:36 EDT (Tue, 08 Jul 2008)
@@ -231,10 +231,10 @@
 
 void list_list()
 {
-    /*
     cout << "---- list/list ----" << endl;
     typedef undirected_graph<City, Road, vertex_list<>, edge_list<> > Graph;
     test_add_remove_vertices<Graph>();
+    /*
     test_add_remove_edges<Graph>();
     test_disconnect_vertex<Graph>();
     test_implicit_disconnect_vertex<Graph>();
@@ -248,10 +248,10 @@
 
 void set_set()
 {
-    /*
     cout << "---- set/set ----" << endl;
     typedef undirected_graph<City, Road, vertex_set<>, edge_set<> > Graph;
     test_add_remove_vertices<Graph>();
+    /*
     test_add_remove_edges<Graph>();
     test_disconnect_vertex<Graph>();
     test_implicit_disconnect_vertex<Graph>();