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

changed the argument order for MutableGraph to be consistent

Browse Source 
with the other functions.
Also added the remove_edge(e, g) and remove_edge(iter, g) functions.


[SVN r7856]
This commit is contained in:
Jeremy Siek
2000-09-27 18:19:35 +00:00
parent e80dc97c43
commit 9245287c65
40 changed files with 730 additions and 399 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
examples/connected_components.cpp
View File

@@ -77,10 +77,10 @@ int main(int argc, char* argv[])
const int N = 6;
Graph G(N);
add_edge(G, 0, 1);
add_edge(G, 1, 4);
add_edge(G, 4, 0);
add_edge(G, 2, 5);
add_edge(0, 1, G);
add_edge(1, 4, G);
add_edge(4, 0, G);
add_edge(2, 5, G);
std::vector<int> c(num_vertices(G));
@@ -104,14 +104,14 @@ int main(int argc, char* argv[])
typedef adjacency_list< vecS, vecS, directedS, VertexProperty > Graph;
const int N = 6;
Graph G(N);
add_edge(G, 0, 1);
add_edge(G, 1, 1);
add_edge(G, 1, 3);
add_edge(G, 1, 4);
add_edge(G, 4, 3);
add_edge(G, 3, 4);
add_edge(G, 3, 0);
add_edge(G, 5, 2);
add_edge(0, 1, G);
add_edge(1, 1, G);
add_edge(1, 3, G);
add_edge(1, 4, G);
add_edge(4, 3, G);
add_edge(3, 4, G);
add_edge(3, 0, G);
add_edge(5, 2, G);
typedef Graph::vertex_descriptor Vertex;