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

2011-11-16T12:50:31Z

moved CPP/Boost/BGL/BidirectionalGraph to Boost/BGL/BidirectionalGraph

Daviddoria: Created page with '==BidirectionalGraph.cpp== #include #include #include //typedef boost::adjacency_l…'

2011-01-27T15:42:57Z

Created page with '==BidirectionalGraph.cpp== <source lang="cpp"> #include <iostream> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> //typedef boost::adjacency_l…'

New page

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

//typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> Graph; //can't use this, in_edges are not defined in this concept - it only stores out_edges for space efficiency
typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> Graph;

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

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

// Get a list of incoming edges to vertex 1
typedef boost::graph_traits < Graph >::in_edge_iterator in_edge_iterator;

std::pair<in_edge_iterator, in_edge_iterator> inEdges = boost::in_edges(1, g);

std::cout << "In edges: " << std::endl;
for(; inEdges.first != inEdges.second; ++inEdges.first)
{
//std::cout << index[*inEdges.first] << " ";
std::cout << *inEdges.first << " ";
}

std::cout << std::endl << "Out edges: " << std::endl;
// Get a list of outgoing edges from vertex 1
typedef boost::graph_traits < Graph >::out_edge_iterator out_edge_iterator;
std::pair<out_edge_iterator, out_edge_iterator> outEdges =
boost::out_edges(1, g);

for(; outEdges.first != outEdges.second; ++outEdges.first)
{
std::cout << *outEdges.first << " ";
}

std::cout << std::endl;

return 0;
}

</source>

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

Project(BidirectionalGraph)

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

</source>

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

Boost/BGL/BidirectionalGraph - Revision history

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

Daviddoria: Created page with '==BidirectionalGraph.cpp== #include #include #include //typedef boost::adjacency_l…'