#include <boost/property_map/property_map.hpp>
#include <boost/concept_archetype.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::detail | |
Functions | |
template<typename V , typename D , typename P , typename B > | |
V | boost::source (const typename incidence_graph_archetype< V, D, P, B >::edge_descriptor &, const incidence_graph_archetype< V, D, P, B > &) |
template<typename V , typename D , typename P , typename B > | |
V | boost::target (const typename incidence_graph_archetype< V, D, P, B >::edge_descriptor &, const incidence_graph_archetype< V, D, P, B > &) |
template<typename V , typename D , typename P , typename B > | |
std::pair< typename incidence_graph_archetype< V, D, P, B >::out_edge_iterator, typename incidence_graph_archetype< V, D, P, B >::out_edge_iterator > | boost::out_edges (const V &, const incidence_graph_archetype< V, D, P, B > &) |
template<typename V , typename D , typename P , typename B > | |
incidence_graph_archetype< V, D, P, B >::degree_size_type | boost::out_degree (const V &, const incidence_graph_archetype< V, D, P, B > &) |
template<typename V , typename D , typename P , typename B > | |
std::pair< typename adjacency_graph_archetype< V, D, P, B >::adjacency_iterator, typename adjacency_graph_archetype< V, D, P, B >::adjacency_iterator > | boost::adjacent_vertices (const V &, const adjacency_graph_archetype< V, D, P, B > &) |
template<typename V , typename D , typename P , typename B > | |
adjacency_graph_archetype< V, D, P, B >::degree_size_type | boost::out_degree (const V &, const adjacency_graph_archetype< V, D, P, B > &) |
template<typename V , typename D , typename P , typename B > | |
std::pair< typename vertex_list_graph_archetype< V, D, P, B >::vertex_iterator, typename vertex_list_graph_archetype< V, D, P, B >::vertex_iterator > | boost::vertices (const vertex_list_graph_archetype< V, D, P, B > &) |
template<typename V , typename D , typename P , typename B > | |
vertex_list_graph_archetype< V, D, P, B >::vertices_size_type | boost::num_vertices (const vertex_list_graph_archetype< V, D, P, B > &) |
template<typename V , typename D , typename P , typename B > | |
vertex_list_graph_archetype< V, D, P, B >::degree_size_type | boost::out_degree (const V &, const vertex_list_graph_archetype< V, D, P, B > &) |
template<typename G , typename P , typename V > | |
property_map < property_graph_archetype< G, P, V >, P >::type | boost::get (P, property_graph_archetype< G, P, V > &) |
template<typename G , typename P , typename V > | |
property_map < property_graph_archetype< G, P, V >, P >::const_type | boost::get (P, const property_graph_archetype< G, P, V > &) |
template<typename G , typename P , typename K , typename V > | |
property_traits< typename property_map < property_graph_archetype< G, P, V >, P >::const_type > ::value_type | boost::get (P p, const property_graph_archetype< G, P, V > &g, K k) |
template<typename G , typename P , typename V , typename Key > | |
void | boost::put (P p, property_graph_archetype< G, P, V > &g, const Key &key, const V &value) |