Boost/BGL/Directed/IterateEdges - Revision history

Daviddoria: use graph_traits

2012-01-26T20:47:34Z

use graph_traits

2011-11-16T12:51:20Z

2011-11-15T22:59:39Z

2011-11-15T22:59:13Z

@@ Line 5: / Line 5: @@
 #include <boost/graph/adjacency_list.hpp>
-typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> Graph;
+typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> Graph;
 int main(int,char*[])

@@ Line 1: / Line 1: @@
 ==IterateEdges.cpp==
 <source lang="cpp">
 #include <iostream>
 #include <boost/graph/adjacency_list.hpp>
@@ Line 12: / Line 11: @@
    Graph g;
-   Graph::vertex_descriptor v0 = boost::add_vertex(g);
+   boost::graph_traits<Graph>::vertex_descriptor v0 = add_vertex(g);
-   Graph::vertex_descriptor v1 = boost::add_vertex(g);
+   Graph::vertex_descriptor v1 = add_vertex(g);
-   std::pair<Graph::edge_descriptor, bool> e0 = boost::add_edge(v0, v1, g);
+   std::pair<boost::graph_traits<Graph>::edge_descriptor, bool> e0 = add_edge(v0, v1, g);
-   std::pair<Graph::edge_iterator, Graph::edge_iterator> edgeIteratorRange = boost::edges(g);
+   std::pair<boost::graph_traits<Graph>::edge_iterator, boost::graph_traits<Graph>::edge_iterator> edgeIteratorRange = boost::edges(g);
-   for(Graph::edge_iterator edgeIterator = edgeIteratorRange.first; edgeIterator != edgeIteratorRange.second; ++edgeIterator)
+   for(boost::graph_traits<Graph>::edge_iterator edgeIterator = edgeIteratorRange.first; edgeIterator != edgeIteratorRange.second; ++edgeIterator)
+    {
       std::cout << *edgeIterator << std::endl;

← Older revision	Revision as of 12:51, 16 November 2011
(No difference)

← Older revision	Revision as of 22:59, 15 November 2011
(No difference)