#include <boost/config.hpp>
#include <list>
#include <vector>
#include <map>
#include <boost/assert.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/graph_mutability_traits.hpp>
#include <boost/graph/properties.hpp>
#include <boost/iterator/indirect_iterator.hpp>
#include <boost/static_assert.hpp>
#include <boost/type_traits.hpp>
#include <boost/mpl/if.hpp>
#include <boost/mpl/or.hpp>
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::detail | |
Functions | |
template<typename G > | |
subgraph< G >::vertex_descriptor | boost::add_vertex (typename subgraph< G >::vertex_descriptor u_global, subgraph< G > &g) |
template<typename G > | |
std::pair< typename graph_traits< G > ::out_edge_iterator, typename graph_traits< G > ::out_edge_iterator > | boost::out_edges (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g) |
template<typename G > | |
graph_traits< G >::degree_size_type | boost::out_degree (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g) |
template<typename G > | |
graph_traits< G > ::vertex_descriptor | boost::source (typename graph_traits< G >::edge_descriptor e, const subgraph< G > &g) |
template<typename G > | |
graph_traits< G > ::vertex_descriptor | boost::target (typename graph_traits< G >::edge_descriptor e, const subgraph< G > &g) |
template<typename G > | |
std::pair< typename graph_traits< G > ::in_edge_iterator, typename graph_traits< G > ::in_edge_iterator > | boost::in_edges (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g) |
template<typename G > | |
graph_traits< G >::degree_size_type | boost::in_degree (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g) |
template<typename G > | |
graph_traits< G >::degree_size_type | boost::degree (typename graph_traits< G >::vertex_descriptor v, const subgraph< G > &g) |
template<typename G > | |
std::pair< typename subgraph < G >::adjacency_iterator, typename subgraph< G > ::adjacency_iterator > | boost::adjacent_vertices (typename subgraph< G >::vertex_descriptor v, const subgraph< G > &g) |
template<typename G > | |
std::pair< typename subgraph < G >::vertex_iterator, typename subgraph< G > ::vertex_iterator > | boost::vertices (const subgraph< G > &g) |
template<typename G > | |
subgraph< G >::vertices_size_type | boost::num_vertices (const subgraph< G > &g) |
template<typename G > | |
std::pair< typename subgraph < G >::edge_iterator, typename subgraph< G >::edge_iterator > | boost::edges (const subgraph< G > &g) |
template<typename G > | |
subgraph< G >::edges_size_type | boost::num_edges (const subgraph< G > &g) |
template<typename G > | |
std::pair< typename subgraph < G >::edge_descriptor, bool > | boost::edge (typename subgraph< G >::vertex_descriptor u, typename subgraph< G >::vertex_descriptor v, const subgraph< G > &g) |
template<typename Vertex , typename Edge , typename Graph > | |
void | boost::detail::add_edge_recur_down (Vertex u_global, Vertex v_global, Edge e_global, subgraph< Graph > &g) |
template<typename Vertex , typename Edge , typename Children , typename G > | |
void | boost::detail::children_add_edge (Vertex u_global, Vertex v_global, Edge e_global, Children &c, subgraph< G > *orig) |
template<typename Vertex , typename Edge , typename Graph > | |
void | boost::detail::add_edge_recur_down (Vertex u_global, Vertex v_global, Edge e_global, subgraph< Graph > &g, subgraph< Graph > *orig) |
template<typename Vertex , typename Graph > | |
std::pair< typename subgraph < Graph >::edge_descriptor, bool > | boost::detail::add_edge_recur_up (Vertex u_global, Vertex v_global, const typename Graph::edge_property_type &ep, subgraph< Graph > &g, subgraph< Graph > *orig) |
template<typename G > | |
std::pair< typename subgraph < G >::edge_descriptor, bool > | boost::add_edge (typename subgraph< G >::vertex_descriptor u, typename subgraph< G >::vertex_descriptor v, const typename G::edge_property_type &ep, subgraph< G > &g) |
template<typename G > | |
std::pair< typename subgraph < G >::edge_descriptor, bool > | boost::add_edge (typename subgraph< G >::vertex_descriptor u, typename subgraph< G >::vertex_descriptor v, subgraph< G > &g) |
template<typename Vertex , typename Graph > | |
void | boost::detail::remove_edge_recur_down (Vertex u_global, Vertex v_global, subgraph< Graph > &g) |
template<typename Vertex , typename Children > | |
void | boost::detail::children_remove_edge (Vertex u_global, Vertex v_global, Children &c) |
template<typename Vertex , typename Graph > | |
void | boost::detail::remove_edge_recur_up (Vertex u_global, Vertex v_global, subgraph< Graph > &g) |
template<typename G , typename Edge , typename Children > | |
void | boost::detail::children_remove_edge (Edge e_global, Children &c) |
template<typename G > | |
void | boost::remove_edge (typename subgraph< G >::vertex_descriptor u, typename subgraph< G >::vertex_descriptor v, subgraph< G > &g) |
template<typename G > | |
void | boost::remove_edge (typename subgraph< G >::edge_descriptor e, subgraph< G > &g) |
template<typename Predicate , typename G > | |
void | boost::remove_edge_if (Predicate p, subgraph< G > &g) |
template<typename G > | |
void | boost::clear_vertex (typename subgraph< G >::vertex_descriptor v, subgraph< G > &g) |
template<typename G > | |
subgraph< G >::vertex_descriptor | boost::detail::add_vertex_recur_up (subgraph< G > &g) |
template<typename G > | |
subgraph< G >::vertex_descriptor | boost::add_vertex (subgraph< G > &g) |
template<typename G , typename Property > | |
property_map< subgraph< G > , Property >::type | boost::get (Property p, subgraph< G > &g) |
template<typename G , typename Property > | |
property_map< subgraph< G > , Property >::const_type | boost::get (Property p, const subgraph< G > &g) |
template<typename G , typename Property , typename Key > | |
property_traits< typename property_map< subgraph< G > , Property >::const_type > ::value_type | boost::get (Property p, const subgraph< G > &g, const Key &k) |
template<typename G , typename Property , typename Key , typename Value > | |
void | boost::put (Property p, subgraph< G > &g, const Key &k, const Value &val) |
template<typename G , typename Property > | |
property_map< subgraph< G > , global_property< Property > >::type | boost::get (global_property< Property > p, subgraph< G > &g) |
template<typename G , typename Property > | |
property_map< subgraph< G > , global_property< Property > >::const_type | boost::get (global_property< Property > p, const subgraph< G > &g) |
template<typename G , typename Property > | |
property_map< subgraph< G > , local_property< Property > >::type | boost::get (local_property< Property > p, subgraph< G > &g) |
template<typename G , typename Property > | |
property_map< subgraph< G > , local_property< Property > >::const_type | boost::get (local_property< Property > p, const subgraph< G > &g) |
template<typename G , typename Tag > | |
graph_property< G, Tag >::type & | boost::get_property (subgraph< G > &g, Tag tag) |
template<typename G , typename Tag > | |
const graph_property< G, Tag > ::type & | boost::get_property (const subgraph< G > &g, Tag tag) |
template<typename G > | |
subgraph< G >::vertex_descriptor | boost::vertex (typename subgraph< G >::vertices_size_type n, const subgraph< G > &g) |
Property Lookup | |
The local_property and global_property functions are used to create structures that determine the lookup strategy for properties in subgraphs. Note that the nested kind member is used to help interoperate with actual Property types. | |
template<typename T > | |
local_property< T > | boost::local (T x) |
template<typename T > | |
global_property< T > | boost::global (T x) |