Go back to Richel Bilderbeek's homepage.
Go back to Richel Bilderbeek's C++ page.
boost::adjacency_list is the 'Swiss army knife' graph
class of the Boost.Graph library.
boost::adjacency_list is defined in the
header file 'boost/graph/adjacency_list.hpp'.
- EdgeList
- Purpose: slect the type of container used to store the edges
- Possible values:
- Default value: boost::vecS
- VertexList
- Purpose: slect the type of container used to store the vertices
- Possible values:
- Default value: boost::vecS
- Directed
- Purpose: directedness of graph
- Possible values:
- boost::directedS: select a directed graph
- boost::undirectedS: select an undirected graph
- boost::bidirectionalS: select a bidirectional graph
- Default value: boost::directedS
- VertexProperties
- Purpose: specify internal vertex property storage
- Possible values:
- boost::no_property: no properties
- boost::property<boost::vertex_name_t,std::string>: vertices contain a std::string
- Default value: boost::no_property
- EdgeProperties
- Purpose: specify internal edge property storage
- Possible values:
- boost::no_property: no properties
- boost::property<boost::edge_name_t,std::string>: edges contain a std::string
- Default value: boost::no_property
- GraphProperties
- Purpose: specify internal graph property storage
- Possible values:
- boost::no_property: no properties
- boost::property<boost::graph_name_t,std::string>: graph has a std::string name
- Default value: boost::no_property
Example
- Jeremy G. Siek, Lie-Quan Lee, Andrew Lumsdaine. The Boost Graph Library. 2002. ISBN: 0-201-72914-8.
Go back to Richel Bilderbeek's C++ page.
Go back to Richel Bilderbeek's homepage.
