boost : : boost.graph : : adjacency_list














































boost : : boost.graph : : adjacency_list




Using boost_adjacency_list


Graphs consist of points and lines. To create a graph, you have to define a set of points and any lines between them. The example code below contains a first simple graph consisting of four points and no lines.


An example code for a graph of type boost :: adjacency_list with four vertices


#include <boost/graph/adjacency_list.hpp> #include <iostream> using namespace boost; int main() { adjacency_list<> g; adjacency_list<>::vertex_descriptor v1 = add_vertex(g); adjacency_list<>::vertex_descriptor v2 = add_vertex(g); adjacency_list<>::vertex_descriptor v3 = add_vertex(g); adjacency_list<>::vertex_descriptor v4 = add_vertex(g); std::cout << v1 << ", " << v2 << ", " << v3 << ", " << v4 << '\n'; }



Output





Boost.Graph provides three containers to define graphs. 

The most important container is boost::adjacency_list which is used in nearly all of the examples in this chapter. To use this class, include the header file boost/graph/adjacency_list.hpp. If you want to use another container, you must include another header file. There is no master header file to get access to all classes and functions from Boost.Graph.

boost::adjacency_list is a template that is instantiated with default parameters in the above example code. This class is defined in boost. All classes and functions from Boost.Graph are defined in this namespace.

The above example identifies points through positive integers. These numbers are indexes to a vector that is used internally in boost::adjacency_list.







More Articles of Vinisha Kingrani:

Name Views Likes
C++ :: boost :: BOOST_FOREACH and BOOST_REVERSE_FOREACH 78 0
C++ boost::system::Creating error categories 61 0
C++ Boost.fusion :: A heterogeneous map with boost::fusion::map 115 0
C++ Boost.fusion :: A heterogeneous vector with boost::fusion::vector 101 0
C++ Boost.fusion :: Accessing elements in Fusion containers with iterators 66 0
C++ phrase_parse() with boost::spirit::qi::skip_flag::dont_postskip 98 0
Boost.MPI 68 2
Boost.Accumulators : : fcalculating weighted variance 69 0
Boost.Accumulators : : mean and variance 72 0
boost::accumulators::tag::count 80 0
boost : : boost.accumulators 64 0
Random paths with random_spanning_tree() 121 0
User-defined properties with dijkstra_shortest_paths() 90 0
Finding paths with dijkstra_shortest_paths() 115 0
Finding distances and paths with breadth_first_search() 80 0
Finding paths with breadth_first_search() 84 0
boost::breadth_first_search() 102 0
Initializing boost::adjacency_list with lines 70 0
boost::adjacent_vertices() and boost::out_edges() 146 1
Creating indexes automatically with boost::add_edge() 91 0
boost::adjacency_list with selectors 101 1
Accessing edges with boost : : edges 80 0
boost : : vertices() 110 1
boost :: add_vertex() 195 0
boost : : boost.graph : : adjacency_list 257 3

Comments