boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-26 04:42:16 +00:00
Code Issues Projects Releases Wiki Activity

Merged Boost.Graph changes from trunk for 1.53

Browse Source 
[SVN r82061]
This commit is contained in:
Jeremiah Willcock
2012-12-17 23:59:46 +00:00
parent 3419d42acc
commit 22b521ecf4
41 changed files with 2795 additions and 150 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
example/undirected_adjacency_list.cpp
View File

@@ -26,12 +26,12 @@ undirected_graph_demo1()
add_edge(zero, two, undigraph);
add_edge(one, two, undigraph);
std::cout << "out_edges(0): ";
std::cout << "out_edges(0):";
for (boost::tie(out, out_end) = out_edges(zero, undigraph); out != out_end; ++out)
std::cout << *out;
std::cout << std::endl << "in_edges(0): ";
std::cout << ' ' << *out;
std::cout << std::endl << "in_edges(0):";
for (boost::tie(in, in_end) = in_edges(zero, undigraph); in != in_end; ++in)
std::cout << *in;
std::cout << ' ' << *in;
std::cout << std::endl;
}
@@ -91,6 +91,14 @@ undirected_graph_demo2()
#endif
std::cout << "weight[(u,v)] = " << get(weight, e1) << std::endl;
std::cout << "weight[(v,u)] = " << get(weight, e2) << std::endl;
std::cout << "the edges incident to v: ";
typename boost::graph_traits<UndirectedGraph>::out_edge_iterator e, e_end;
typename boost::graph_traits<UndirectedGraph>::vertex_descriptor
s = vertex(0, undigraph);
for (boost::tie(e, e_end) = out_edges(s, undigraph); e != e_end; ++e)
std::cout << "(" << source(*e, undigraph)
<< "," << target(*e, undigraph) << ")" << std::endl;
}
@@ -103,7 +111,7 @@ main()
typedef adjacency_list < vecS, vecS, directedS,
no_property, Weight > DirectedGraph;
undirected_graph_demo1 < UndirectedGraph > ();
undirected_graph_demo2 < UndirectedGraph > ();
directed_graph_demo < DirectedGraph > ();
undirected_graph_demo2 < UndirectedGraph > ();
return 0;
}