From 66e33316455e1cff0c173cd72f1c19a8ae91f72d Mon Sep 17 00:00:00 2001
From: Jeremy Siek <jeremy.siek@gmail.com>
Date: Tue, 7 Aug 2001 20:34:37 +0000
Subject: [PATCH] MutableGraph -> EdgeMutableGraph

[SVN r10808]
---
 include/boost/graph/transitive_closure.hpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/include/boost/graph/transitive_closure.hpp b/include/boost/graph/transitive_closure.hpp
index 7a9779d2..96d9c022 100644
--- a/include/boost/graph/transitive_closure.hpp
+++ b/include/boost/graph/transitive_closure.hpp
@@ -241,7 +241,7 @@ namespace boost {
     using namespace detail;
 
     function_requires< AdjacencyGraphConcept<G> >();
-    function_requires< MutableGraphConcept<G> >();
+    function_requires< EdgeMutableGraphConcept<G> >();
      
     typedef typename graph_traits<G>::vertex_descriptor vertex;
     typedef typename graph_traits<G>::edge_descriptor edge;
@@ -356,7 +356,7 @@ namespace boost {
     typedef typename graph_traits<G>::vertex_iterator vertex_iterator;
 
     function_requires< AdjacencyMatrixConcept<G> >();
-    function_requires< MutableGraphConcept<G> >();
+    function_requires< EdgeMutableGraphConcept<G> >();
 
     // Matrix form:
     // for k
@@ -384,7 +384,7 @@ namespace boost {
     typedef typename graph_traits<G>::vertex_iterator vertex_iterator;
 
     function_requires< AdjacencyMatrixConcept<G> >();
-    function_requires< MutableGraphConcept<G> >();
+    function_requires< EdgeMutableGraphConcept<G> >();
 
     // Make sure second loop will work  
     if (num_vertices(g) == 0)