mirror of
https://github.com/boostorg/graph.git
synced 2026-01-27 19:02:12 +00:00
Quickbook: Merge from trunk.
Includes blocks in lists fixes, and some documentation changes. [SVN r77347]
This commit is contained in:
26
example/directed_graph.cpp
Normal file
26
example/directed_graph.cpp
Normal file
@@ -0,0 +1,26 @@
|
||||
//=======================================================================
|
||||
// Copyright 2012
|
||||
// Authors: David Doria
|
||||
//
|
||||
// Distributed under the Boost Software License, Version 1.0. (See
|
||||
// accompanying file LICENSE_1_0.txt or copy at
|
||||
// http://www.boost.org/LICENSE_1_0.txt)
|
||||
//=======================================================================
|
||||
|
||||
#include <boost/graph/directed_graph.hpp> // A subclass to provide reasonable arguments to adjacency_list for a typical directed graph
|
||||
|
||||
int main(int,char*[])
|
||||
{
|
||||
// directed_graph is a subclass of adjacency_list which gives you object oriented access to functions
|
||||
// like add_vertex and add_edge, which makes the code easier to understand. However, it hard codes many
|
||||
// of the template parameters, so it is much less flexible.
|
||||
|
||||
typedef boost::directed_graph<> Graph;
|
||||
Graph g;
|
||||
boost::graph_traits<Graph>::vertex_descriptor v0 = g.add_vertex();
|
||||
boost::graph_traits<Graph>::vertex_descriptor v1 = g.add_vertex();
|
||||
|
||||
g.add_edge(v0, v1);
|
||||
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user