CPP/Boost/BGL/FilteredGraphVertices - Revision history

Daviddoria: Get a vertex_iterator

2012-01-26T15:25:52Z

Get a vertex_iterator

Daviddoria: moved CPP/Boost/BGL/FilteredGraph to CPP/Boost/BGL/FilteredGraphVertices

2012-01-26T15:24:38Z

moved CPP/Boost/BGL/FilteredGraph to CPP/Boost/BGL/FilteredGraphVertices

Daviddoria: Created page with '==FilteredGraph.cpp== #include #include #include #include #inc…'

2012-01-22T21:55:53Z

Created page with '==FilteredGraph.cpp== <source lang="cpp"> #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/array.hpp> #include <boost/graph/filtered_graph.hpp> #inc…'

New page

==FilteredGraph.cpp==
<source lang="cpp">
#include <iostream>

#include <boost/graph/adjacency_list.hpp>
#include <boost/array.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/graph/graph_utility.hpp>

template <typename TGraph>
struct vertex_id_filter
{
bool operator()(const typename boost::graph_traits<TGraph>::vertex_descriptor& v) const
{
return 3 < v; // keep all vertx_descriptors greater than 3
}
};

int main()
{
using namespace boost;

typedef adjacency_list<vecS, vecS, directedS,
no_property, property<edge_weight_t, int> > Graph;
typedef property_map<Graph, edge_weight_t>::type EdgeWeightMap;

unsigned int numberOfVertices = 10;
Graph g(numberOfVertices);
for(unsigned int i = 0; i < numberOfVertices - 1; ++i)
{
add_edge(i, i+1, g);
}

std::cout << "Original graph:" << std::endl;
boost::print_graph(g);

vertex_id_filter<Graph> filter;
filtered_graph<Graph, boost::keep_all, vertex_id_filter<Graph> > filteredGraph(g, boost::keep_all(), filter); // (graph, EdgePredicate, VertexPredicate)

std::cout << "Filtered graph:" << std::endl;
boost::print_graph(filteredGraph);
return 0;
}

</source>

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

Project(DepthFirstSearch)

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

</source>

@@ Line 19: / Line 19: @@
 int main()
+{
-   typedef adjacency_list<vecS, vecS, directedS,
+   typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS,
-     no_property, property<edge_weight_t, int> > Graph;
+     boost::no_property, boost::property<boost::edge_weight_t, int> > Graph;
-   typedef property_map<Graph, edge_weight_t>::type EdgeWeightMap;
+   typedef boost::property_map<Graph, boost::edge_weight_t>::type EdgeWeightMap;
    unsigned int numberOfVertices = 10;
@@ Line 36: / Line 35: @@
    vertex_id_filter<Graph> filter;
-   filtered_graph<Graph, boost::keep_all, vertex_id_filter<Graph> > filteredGraph(g, boost::keep_all(), filter); // (graph, EdgePredicate, VertexPredicate)
+   typedef boost::filtered_graph<Graph, boost::keep_all, vertex_id_filter<Graph> > FilteredGraphType;
    std::cout << "Filtered graph:" << std::endl;
    boost::print_graph(filteredGraph);
    return 0;
+}
@@ Line 49: / Line 52: @@
 cmake_minimum_required(VERSION 2.6)
-Project(DepthFirstSearch)
+Project(FilteredGraphVertices)
 set(Boost_USE_MULTITHREADED ON)
@@ Line 57: / Line 60: @@
 LINK_DIRECTORIES(${LINK_DIRECTORIES} ${Boost_LIBRARY_DIRS})
-ADD_EXECUTABLE(FilteredGraph FilteredGraph.cpp)
+ADD_EXECUTABLE(FilteredGraphVertices FilteredGraphVertices.cpp)
 </source>

← Older revision	Revision as of 15:24, 26 January 2012
(No difference)