...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
directed_graph<VertexProp, EdgeProp, GraphProp>
The directed_graph class template is a simplified version of the BGL adjacency list. This class is provided for ease of use, but may not perform as well as custom-defined adjacency list classes. Instances of this template model the BidirectionalGraph, VertexIndexGraph, and EdgeIndexGraph concepts.
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);
Parameter | Description | Default |
---|---|---|
VertexProp | A property map for the graph vertices. | |
EdgeProp | A property map for the graph edges. | |
GraphProp | A property map for the graph itself. |
boost/graph/directed_graph.hpp
Copyright © 2000-2001 |
Jeremy Siek,
Indiana University (jsiek@osl.iu.edu) Lie-Quan Lee, Indiana University (llee@cs.indiana.edu) Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) |