#include <boost/config.hpp>
#include <boost/iterator.hpp>
#include <boost/operators.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <gb_graph.h>
#include <gb_io.h>
#include <gb_flip.h>
#include <gb_dijk.h>
#include <gb_basic.h>
#include <gb_books.h>
#include <gb_econ.h>
#include <gb_games.h>
#include <gb_gates.h>
#include <gb_lisa.h>
#include <gb_miles.h>
#include <gb_plane.h>
#include <gb_raman.h>
#include <gb_rand.h>
#include <gb_roget.h>
#include <gb_save.h>
#include <gb_words.h>
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::detail | |
Macros | |
#define | SGB_PROPERTY_TAG(KIND, TAG) |
#define | SGB_GET_UTIL_FIELD(KIND, X) |
#define | SGB_UTIL_ACCESSOR(KIND, X) |
Typedefs | |
typedef Graph * | boost::sgb_graph_ptr |
typedef const Graph * | boost::sgb_const_graph_ptr |
Functions | |
Graph * | empty (long n) |
std::pair< sgb_vertex_iterator, sgb_vertex_iterator > | boost::vertices (sgb_const_graph_ptr g) |
std::pair < sgb_out_edge_iterator, sgb_out_edge_iterator > | boost::out_edges (Vertex *u, sgb_const_graph_ptr) |
boost::graph_traits < sgb_graph_ptr > ::degree_size_type | boost::out_degree (Vertex *u, sgb_const_graph_ptr g) |
std::pair< sgb_adj_iterator, sgb_adj_iterator > | boost::adjacent_vertices (Vertex *u, sgb_const_graph_ptr) |
long | boost::num_vertices (sgb_const_graph_ptr g) |
long | boost::num_edges (sgb_const_graph_ptr g) |
Vertex * | boost::vertex (long v, sgb_const_graph_ptr g) |
sgb_vertex_id_map | boost::get (vertex_index_t, sgb_graph_ptr g) |
sgb_vertex_name_map | boost::get (vertex_name_t, sgb_graph_ptr) |
Vertex *& | boost::get_util (util &u, Vertex *) |
Arc *& | boost::get_util (util &u, Arc *) |
sgb_graph_ptr & | boost::get_util (util &u, sgb_graph_ptr) |
char *& | boost::get_util (util &u, char *) |
long & | boost::get_util (util &u, long) |
template<class T > | |
T & | boost::get_util_field (Vertex *k, u_property< T >) |
template<class T > | |
T & | boost::get_util_field (Vertex *k, v_property< T >) |
template<class T > | |
T & | boost::get_util_field (Vertex *k, w_property< T >) |
template<class T > | |
T & | boost::get_util_field (Vertex *k, x_property< T >) |
template<class T > | |
T & | boost::get_util_field (Vertex *k, y_property< T >) |
template<class T > | |
T & | boost::get_util_field (Vertex *k, z_property< T >) |
template<class T > | |
T & | boost::get_util_field (Arc *k, a_property< T >) |
template<class T > | |
T & | boost::get_util_field (Arc *k, b_property< T >) |
template<class Tag > | |
sgb_vertex_util_map< Tag, const typename Tag::type & > | boost::get_property_map (Tag, const sgb_graph_ptr &g, vertex_property_tag) |
template<class Tag > | |
sgb_vertex_util_map< Tag, typename Tag::type & > | boost::get_property_map (Tag, sgb_graph_ptr &g, vertex_property_tag) |
template<class Tag > | |
sgb_edge_util_map< Tag, const typename Tag::type & > | boost::get_property_map (Tag, const sgb_graph_ptr &g, edge_property_tag) |
template<class Tag > | |
sgb_edge_util_map< Tag, typename Tag::type & > | boost::get_property_map (Tag, sgb_graph_ptr &g, edge_property_tag) |
sgb_edge_length_map< const long & > | boost::get (edge_length_t, const sgb_graph_ptr &) |
sgb_edge_length_map< const long & > | boost::get (edge_length_t, const sgb_const_graph_ptr &) |
sgb_edge_length_map< long & > | boost::get (edge_length_t, sgb_graph_ptr &) |
long | boost::get (edge_length_t, const sgb_graph_ptr &, const sgb_edge &key) |
long | boost::get (edge_length_t, const sgb_const_graph_ptr &, const sgb_edge &key) |
void | boost::put (edge_length_t, sgb_graph_ptr &, const sgb_edge &key, long value) |
template<class T > | |
sgb_vertex_util_map < u_property< T >, T & > | boost::get (u_property< T >, sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < u_property< T >, const T & > | boost::get (u_property< T >, const sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < u_property< T >, const T & > | boost::get (u_property< T >, const sgb_const_graph_ptr &) |
template<class T , class Key > | |
sgb_vertex_util_map < u_property< T >, const T & > ::value_type | boost::get (u_property< T >, const sgb_graph_ptr &, const Key &key) |
template<class T , class Key > | |
sgb_vertex_util_map < u_property< T >, const T & > ::value_type | boost::get (u_property< T >, const sgb_const_graph_ptr &, const Key &key) |
template<class T , class Key , class Value > | |
void | boost::put (u_property< T >, sgb_graph_ptr &, const Key &key, const Value &value) |
template<class T > | |
sgb_vertex_util_map < v_property< T >, T & > | boost::get (v_property< T >, sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < v_property< T >, const T & > | boost::get (v_property< T >, const sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < v_property< T >, const T & > | boost::get (v_property< T >, const sgb_const_graph_ptr &) |
template<class T , class Key > | |
sgb_vertex_util_map < v_property< T >, const T & > ::value_type | boost::get (v_property< T >, const sgb_graph_ptr &, const Key &key) |
template<class T , class Key > | |
sgb_vertex_util_map < v_property< T >, const T & > ::value_type | boost::get (v_property< T >, const sgb_const_graph_ptr &, const Key &key) |
template<class T , class Key , class Value > | |
void | boost::put (v_property< T >, sgb_graph_ptr &, const Key &key, const Value &value) |
template<class T > | |
sgb_vertex_util_map < w_property< T >, T & > | boost::get (w_property< T >, sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < w_property< T >, const T & > | boost::get (w_property< T >, const sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < w_property< T >, const T & > | boost::get (w_property< T >, const sgb_const_graph_ptr &) |
template<class T , class Key > | |
sgb_vertex_util_map < w_property< T >, const T & > ::value_type | boost::get (w_property< T >, const sgb_graph_ptr &, const Key &key) |
template<class T , class Key > | |
sgb_vertex_util_map < w_property< T >, const T & > ::value_type | boost::get (w_property< T >, const sgb_const_graph_ptr &, const Key &key) |
template<class T , class Key , class Value > | |
void | boost::put (w_property< T >, sgb_graph_ptr &, const Key &key, const Value &value) |
template<class T > | |
sgb_vertex_util_map < x_property< T >, T & > | boost::get (x_property< T >, sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < x_property< T >, const T & > | boost::get (x_property< T >, const sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < x_property< T >, const T & > | boost::get (x_property< T >, const sgb_const_graph_ptr &) |
template<class T , class Key > | |
sgb_vertex_util_map < x_property< T >, const T & > ::value_type | boost::get (x_property< T >, const sgb_graph_ptr &, const Key &key) |
template<class T , class Key > | |
sgb_vertex_util_map < x_property< T >, const T & > ::value_type | boost::get (x_property< T >, const sgb_const_graph_ptr &, const Key &key) |
template<class T , class Key , class Value > | |
void | boost::put (x_property< T >, sgb_graph_ptr &, const Key &key, const Value &value) |
template<class T > | |
sgb_vertex_util_map < y_property< T >, T & > | boost::get (y_property< T >, sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < y_property< T >, const T & > | boost::get (y_property< T >, const sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < y_property< T >, const T & > | boost::get (y_property< T >, const sgb_const_graph_ptr &) |
template<class T , class Key > | |
sgb_vertex_util_map < y_property< T >, const T & > ::value_type | boost::get (y_property< T >, const sgb_graph_ptr &, const Key &key) |
template<class T , class Key > | |
sgb_vertex_util_map < y_property< T >, const T & > ::value_type | boost::get (y_property< T >, const sgb_const_graph_ptr &, const Key &key) |
template<class T , class Key , class Value > | |
void | boost::put (y_property< T >, sgb_graph_ptr &, const Key &key, const Value &value) |
template<class T > | |
sgb_vertex_util_map < z_property< T >, T & > | boost::get (z_property< T >, sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < z_property< T >, const T & > | boost::get (z_property< T >, const sgb_graph_ptr &) |
template<class T > | |
sgb_vertex_util_map < z_property< T >, const T & > | boost::get (z_property< T >, const sgb_const_graph_ptr &) |
template<class T , class Key > | |
sgb_vertex_util_map < z_property< T >, const T & > ::value_type | boost::get (z_property< T >, const sgb_graph_ptr &, const Key &key) |
template<class T , class Key > | |
sgb_vertex_util_map < z_property< T >, const T & > ::value_type | boost::get (z_property< T >, const sgb_const_graph_ptr &, const Key &key) |
template<class T , class Key , class Value > | |
void | boost::put (z_property< T >, sgb_graph_ptr &, const Key &key, const Value &value) |
template<class T > | |
sgb_edge_util_map< a_property < T >, T & > | boost::get (a_property< T >, sgb_graph_ptr &) |
template<class T > | |
sgb_edge_util_map< a_property < T >, const T & > | boost::get (a_property< T >, const sgb_graph_ptr &) |
template<class T > | |
sgb_edge_util_map< a_property < T >, const T & > | boost::get (a_property< T >, const sgb_const_graph_ptr &) |
template<class T , class Key > | |
sgb_edge_util_map< a_property < T >, const T & >::value_type | boost::get (a_property< T >, const sgb_graph_ptr &, const Key &key) |
template<class T , class Key > | |
sgb_edge_util_map< a_property < T >, const T & >::value_type | boost::get (a_property< T >, const sgb_const_graph_ptr &, const Key &key) |
template<class T , class Key , class Value > | |
void | boost::put (a_property< T >, sgb_graph_ptr &, const Key &key, const Value &value) |
template<class T > | |
sgb_edge_util_map< b_property < T >, T & > | boost::get (b_property< T >, sgb_graph_ptr &) |
template<class T > | |
sgb_edge_util_map< b_property < T >, const T & > | boost::get (b_property< T >, const sgb_graph_ptr &) |
template<class T > | |
sgb_edge_util_map< b_property < T >, const T & > | boost::get (b_property< T >, const sgb_const_graph_ptr &) |
template<class T , class Key > | |
sgb_edge_util_map< b_property < T >, const T & >::value_type | boost::get (b_property< T >, const sgb_graph_ptr &, const Key &key) |
template<class T , class Key > | |
sgb_edge_util_map< b_property < T >, const T & >::value_type | boost::get (b_property< T >, const sgb_const_graph_ptr &, const Key &key) |
template<class T , class Key , class Value > | |
void | boost::put (b_property< T >, sgb_graph_ptr &, const Key &key, const Value &value) |
#define SGB_GET_UTIL_FIELD | ( | KIND, | |
X | |||
) |
#define SGB_PROPERTY_TAG | ( | KIND, | |
TAG | |||
) |
#define SGB_UTIL_ACCESSOR | ( | KIND, | |
X | |||
) |
|
inline |
References boost::spirit::lex::lexertl::detail::L().
Referenced by boost::numeric::abs(), boost::numeric::acos(), boost::numeric::acosh(), boost::numeric::interval_lib::add(), boost::wave::util::VectorStringStorage< E, A >::append(), boost::numeric::asin(), boost::numeric::asinh(), boost::numeric::atan(), boost::numeric::atanh(), boost::numeric::bisect(), boost::numeric::BOOST_PREVENT_MACRO_SUBSTITUTION(), boost::numeric::cosh(), boost::numeric::interval_lib::div(), boost::numeric::interval_lib::division_part1(), boost::heap::d_ary_heap< T, A0, A1, A2, A3, A4, A5 >::empty(), boost::numeric::exp(), boost::numeric::log(), boost::numeric::interval_lib::mul(), boost::numeric::interval_lib::multiplicative_inverse(), boost::numeric::nth_root(), boost::numeric::operator*(), boost::numeric::pow(), std::numeric_limits< boost::numeric::interval< T, Policies > >::quiet_NaN(), boost::numeric::sin(), boost::numeric::sinh(), boost::numeric::sqrt(), boost::numeric::square(), boost::numeric::interval_lib::sub(), boost::numeric::tan(), and boost::numeric::tanh().