Boost/BGL/CreateGraph - Revision history

Daviddoria: moved CPP/Boost/CreateGraph to Boost/BGL/CreateGraph

2011-11-16T12:37:00Z

moved CPP/Boost/CreateGraph to Boost/BGL/CreateGraph

Daviddoria at 13:42, 30 June 2011

2011-06-30T13:42:40Z

Daviddoria: Major revision - demonstrate creating a graph with adjacency_list, undirected_graph and directed_graph

2011-06-12T17:54:05Z

Major revision - demonstrate creating a graph with adjacency_list, undirected_graph and directed_graph

Show changes

Awallin: template params for adjacency_list

2011-06-12T07:03:49Z

template params for adjacency_list

Daviddoria at 20:16, 26 January 2011

2011-01-26T20:16:40Z

Daviddoria: Created page with '==Timer.cpp== #include // for std::cout #include // for std::pair #include …'

2011-01-26T19:28:23Z

Created page with '==Timer.cpp== <source lang="cpp"> #include <iostream> // for std::cout #include <utility> // for std::pair #include <algorithm> …'

New page

==Timer.cpp==
<source lang="cpp">
#include <iostream> // for std::cout
#include <utility> // for std::pair
#include <algorithm> // for std::for_each
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>

using namespace boost;

typedef adjacency_list<vecS, vecS, bidirectionalS> Graph;
/*
void OutputVertices(const Graph &g);
void OutputEdges(const Graph &g);
*/
int main(int,char*[])
{
// Construct a graph
Graph g(3); // 3 vertices

add_edge(0, 1, g);
add_edge(1, 2, g);

// Get the vertices
typedef property_map<Graph, vertex_index_t>::type IndexMap;
IndexMap index = get(vertex_index, g);

std::cout << "vertices = ";
typedef graph_traits<Graph>::vertex_iterator vertex_iter;
std::pair<vertex_iter, vertex_iter> vp;
for (vp = vertices(g); vp.first != vp.second; ++vp.first)
{
std::cout << index[*vp.first] << " ";
}
std::cout << std::endl;

// Get the edges
std::cout << "edges = ";
graph_traits<Graph>::edge_iterator ei, ei_end;
for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
{
std::cout << "(" << index[source(*ei, g)]
<< "," << index[target(*ei, g)] << ") ";
}
std::cout << std::endl;

return 0;
}

/*
void OutputVertices(const Graph &g)
{
// get the vertices
typedef property_map<Graph, vertex_index_t>::type IndexMap;
IndexMap index = get(vertex_index, g);

std::cout << "vertices(g) = ";
typedef graph_traits<Graph>::vertex_iterator vertex_iter;
std::pair<vertex_iter, vertex_iter> vp;
for (vp = vertices(g); vp.first != vp.second; ++vp.first)
{
std::cout << index[*vp.first] << " ";
}
std::cout << std::endl;
}

void OutputEdges(const Graph &g)
{
typedef property_map<Graph, vertex_index_t>::type IndexMap;
IndexMap index = get(vertex_index, g);

//get the edges
std::cout << "edges(g) = ";
graph_traits<Graph>::edge_iterator ei, ei_end;
for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
{
std::cout << "(" << index[source(*ei, g)]
<< "," << index[target(*ei, g)] << ") ";

//property_map<Graph, edge_weight_t>::type edge_weight = get(edge_weight_t(), g);
}
std::cout << std::endl;
}
*/
</source>

==CMakeLists.txt==
<source lang="cmake">
cmake_minimum_required(VERSION 2.6)

Project(ConstructGraph)

set(Boost_USE_MULTITHREADED ON)
FIND_PACKAGE(Boost 1.38 COMPONENTS required)

INCLUDE_DIRECTORIES(${INCLUDE_DIRECTORIES} ${Boost_INCLUDE_DIRS})
LINK_DIRECTORIES(${LINK_DIRECTORIES} ${Boost_LIBRARY_DIRS})

ADD_EXECUTABLE(ConstructGraph ConstructGraph.cpp)
target_link_libraries(ConstructGraph)

</source>

@@ Line 1: / Line 1: @@
 ==CreateGraph.cpp==
 <source lang="cpp">
 // STL

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

@@ Line 6: / Line 6: @@
 #include <boost/graph/graph_traits.hpp>
 #include <boost/graph/adjacency_list.hpp>
 typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> Graph;
 int main(int,char*[])

@@ Line 1: / Line 1: @@
-==Timer.cpp==
+==CreateGraph.cpp==
 <source lang="cpp">
 #include <iostream>                  // for std::cout
@@ Line 7: / Line 7: @@
 #include <boost/graph/adjacency_list.hpp>
-using namespace boost;
+//using namespace boost;
 int main(int,char*[])
+{
@@ Line 23: / Line 20: @@
    // Get the vertices
-   typedef property_map<Graph, vertex_index_t>::type IndexMap;
+   typedef boost::property_map<Graph, boost::vertex_index_t>::type IndexMap;
-  IndexMap index = get(vertex_index, g);
    std::cout << "vertices = ";
-   typedef graph_traits<Graph>::vertex_iterator vertex_iter;
+   typedef boost::graph_traits<Graph>::vertex_iterator vertex_iter;
-   std::pair<vertex_iter, vertex_iter> vp;
+   std::pair<vertex_iter, vertex_iter> vertexPair;
-   for (vp = vertices(g); vp.first != vp.second; ++vp.first)
+   // The call to vertices(g) sets vp to (0, numberOfElements)
+   {
-	  std::cout << index[*vp.first] <<  " ";
+    // You can see what is going on with this:
+   }
    std::cout << std::endl;
    std::cout << "edges = ";
-   graph_traits<Graph>::edge_iterator ei, ei_end;
+   typedef boost::graph_traits<Graph>::edge_iterator edge_iter;
-   for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
+  std::pair<edge_iter, edge_iter> edgePair;
+   {
-	  std::cout << "(" << index[source(*ei, g)]
+      std::cout << "(" << index[source(*edgePair.first, g)]
-			  << "," << index[target(*ei, g)] << ") ";
+              << "," << index[target(*edgePair.first, g)] << ") ";
+   }
    std::cout << std::endl;
    return 0;
+}
 </source>