Boost/BGL/BundledProperties - Revision history

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

2011-11-16T12:50:00Z

moved CPP/Boost/BGL/BundledProperties to Boost/BGL/BundledProperties

Daviddoria: Majorly simplified

2011-06-22T23:22:37Z

Majorly simplified

Awallin: with bundled properties, using operator[] is more elegant (?)

2011-06-11T21:53:28Z

with bundled properties, using operator[] is more elegant (?)

Daviddoria: Created page with '==BundledProperties.cpp== #include #include // Create a struct to hold several properties struct MyProperty { i…'

2011-01-27T18:40:07Z

Created page with '==BundledProperties.cpp== <source lang="cpp"> #include <iostream> #include <boost/graph/adjacency_list.hpp> // Create a struct to hold several properties struct MyProperty { i…'

New page

==BundledProperties.cpp==
<source lang="cpp">
#include <iostream>
#include <boost/graph/adjacency_list.hpp>

// Create a struct to hold several properties
struct MyProperty
{
int MyIntProperty;
std::string MyStringProperty;
};

// Define the type of the graph - this specifies a bundled property for vertices
typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, MyProperty> Graph;

// Define the type of the graph - this specifies a bundled property for edges
//typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, MyProperty> Graph;

int main(int,char*[])
{
// Create a graph object
Graph g(2);

boost::property_map<Graph, int MyProperty::*>::type MyIntPropertyMap = boost::get(&MyProperty::MyIntProperty, g);
boost::put(MyIntPropertyMap, 0, 5);
boost::put(MyIntPropertyMap, 1, 10);

boost::property_map<Graph, std::string MyProperty::*>::type MyStringPropertyMap = boost::get(&MyProperty::MyStringProperty, g);
boost::put(MyStringPropertyMap, 0, "TestName0");
boost::put(MyStringPropertyMap, 1, "TestName1");

typedef boost::property_map<Graph, boost::vertex_index_t>::type IndexMap;
IndexMap index = get(boost::vertex_index, g);

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

return 0;
}

</source>

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

Project(BundledProperties)

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(BundledProperties BundledProperties.cpp)
target_link_libraries(BundledProperties)

</source>

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

@@ Line 4: / Line 4: @@
 #include <boost/graph/adjacency_list.hpp>
-// Create a struct to hold several properties
+// Create a struct to hold properties for each vertex
-struct MyProperty
+struct VertexProperties
+{
-   int MyIntProperty;
+   int VertexIntProperty;
-   std::string MyStringProperty;
+   std::string VertexStringProperty;
 };
-// Define the type of the graph - this specifies a bundled property for vertices
+// Create a struct to hold properties for each edge
-typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, MyProperty> Graph;
+struct EdgeProperties
-// Define the type of the graph - this specifies a bundled property for edges
+// Define the type of the graph
-//typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, MyProperty> Graph;
+typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, VertexProperties, EdgeProperties> Graph;
 int main(int,char*[])
+{
    // Create a graph object
-   Graph g(2);
+   Graph g;
-   boost::property_map<Graph, int MyProperty::*>::type MyIntPropertyMap = boost::get(&MyProperty::MyIntProperty, g);
+   // Add two vertices
-   boost::put(MyIntPropertyMap, 0, 5);
+  Graph::vertex_descriptor v0 = boost::add_vertex(g);
-  boost::put(MyIntPropertyMap, 1, 10);
+   Graph::vertex_descriptor v1 = boost::add_vertex(g);
-   boost::property_map<Graph, std::string MyProperty::*>::type MyStringPropertyMap = boost::get(&MyProperty::MyStringProperty, g);
+   // Add an edge
-  boost::put(MyStringPropertyMap, 0, "TestName0");
+  std::pair<Graph::edge_descriptor, bool> e01 = boost::add_edge(v0, v1, g);
-  boost::put(MyStringPropertyMap, 1, "TestName1");
-−
-  // NOTE: the above code is equivalent to the slightly more elegant:
-  // g[0].MyIntProperty = 5
-  // g[1].MyIntProperty = 10
-  // g[0].MyStringProperty = "TestName0"
-  // g[1].MyStringProperty = "TestName1"
-   typedef boost::property_map<Graph, boost::vertex_index_t>::type IndexMap;
+   // Set and output the properties of a single vertex
-   IndexMap index = get(boost::vertex_index, g);
+  g[v0].VertexIntProperty = 5;
-   typedef boost::graph_traits<Graph>::vertex_iterator vertex_iter;
+   // Set and output the properties of each edge
-   std::pair<vertex_iter, vertex_iter> vertexPair;
+   std::pair<Graph::edge_iterator, Graph::edge_iterator> edgeIteratorRange = boost::edges(g);
-   for (vertexPair = vertices(g); vertexPair.first != vertexPair.second; ++vertexPair.first)
+   for(Graph::edge_iterator edgeIterator = edgeIteratorRange.first; edgeIterator != edgeIteratorRange.second; ++edgeIterator)
+     {
-     std::cout << index[*vertexPair.first] <<  " : " << MyIntPropertyMap[*vertexPair.first] << " : " << MyStringPropertyMap[*vertexPair.first] <<  std::endl;
+    g[*edgeIterator].EdgeIntProperty = 5;
+     }