boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-27 17:12:11 +00:00
Code Issues Projects Releases Wiki Activity

MutableGraph -> EdgeMutableGraph

Browse Source 
[SVN r10808]
This commit is contained in:
Jeremy Siek
2001-08-07 20:34:37 +00:00
parent 11143f35ed
commit 66e3331645
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
include/boost/graph/transitive_closure.hpp
View File

@@ -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)