boost::reverse_graph< BidirectionalGraph, GraphRef > Class Template Reference

#include <reverse_graph.hpp>

Public Types
enum	{ is_edge_list }
typedef BidirectionalGraph	base_type
typedef GraphRef	base_ref_type
typedef Traits::vertex_descriptor	vertex_descriptor
typedef detail::reverse_graph_edge_descriptor < typename Traits::edge_descriptor >	edge_descriptor
typedef Traits::directed_category	directed_category
typedef Traits::edge_parallel_category	edge_parallel_category
typedef Traits::traversal_category	traversal_category
typedef transform_iterator < detail::reverse_graph_edge_descriptor_maker < typename Traits::edge_descriptor > , typename Traits::in_edge_iterator >	out_edge_iterator
typedef Traits::degree_size_type	degree_size_type
typedef transform_iterator < detail::reverse_graph_edge_descriptor_maker < typename Traits::edge_descriptor > , typename Traits::out_edge_iterator >	in_edge_iterator
typedef adjacency_iterator_generator < Self, vertex_descriptor, out_edge_iterator >::type	adjacency_iterator
typedef Traits::vertex_iterator	vertex_iterator
typedef detail::choose_rev_edge_iter < is_edge_list >	ChooseEdgeIter
typedef ChooseEdgeIter::template bind_ < BidirectionalGraph >::type	edge_iterator
typedef Traits::vertices_size_type	vertices_size_type
typedef Traits::edges_size_type	edges_size_type
typedef reverse_graph_tag	graph_tag

Public Member Functions
	reverse_graph (GraphRef g)
	reverse_graph (const reverse_graph< BidirectionalGraph, BidirectionalGraph & > &o)
template<typename Descriptor >
graph::detail::bundled_result < BidirectionalGraph, typename detail::get_underlying_descriptor_from_reverse_descriptor < Descriptor >::type >::type &	operator[] (Descriptor x)
template<typename Descriptor >
graph::detail::bundled_result < BidirectionalGraph, typename detail::get_underlying_descriptor_from_reverse_descriptor < Descriptor >::type >::type const &	operator[] (Descriptor x) const

Static Public Member Functions
static vertex_descriptor	null_vertex ()

Public Attributes
GraphRef	m_g

Member Typedef Documentation

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef adjacency_iterator_generator<Self, vertex_descriptor, out_edge_iterator>::type boost::reverse_graph< BidirectionalGraph, GraphRef >::adjacency_iterator

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef GraphRef boost::reverse_graph< BidirectionalGraph, GraphRef >::base_ref_type

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef BidirectionalGraph boost::reverse_graph< BidirectionalGraph, GraphRef >::base_type

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef detail::choose_rev_edge_iter<is_edge_list> boost::reverse_graph< BidirectionalGraph, GraphRef >::ChooseEdgeIter

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef Traits::degree_size_type boost::reverse_graph< BidirectionalGraph, GraphRef >::degree_size_type

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef Traits::directed_category boost::reverse_graph< BidirectionalGraph, GraphRef >::directed_category

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef detail::reverse_graph_edge_descriptor<typename Traits::edge_descriptor> boost::reverse_graph< BidirectionalGraph, GraphRef >::edge_descriptor

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef ChooseEdgeIter:: template bind_<BidirectionalGraph>::type boost::reverse_graph< BidirectionalGraph, GraphRef >::edge_iterator

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef Traits::edge_parallel_category boost::reverse_graph< BidirectionalGraph, GraphRef >::edge_parallel_category

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef Traits::edges_size_type boost::reverse_graph< BidirectionalGraph, GraphRef >::edges_size_type

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef reverse_graph_tag boost::reverse_graph< BidirectionalGraph, GraphRef >::graph_tag

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef transform_iterator<detail::reverse_graph_edge_descriptor_maker<typename Traits::edge_descriptor>, typename Traits::out_edge_iterator> boost::reverse_graph< BidirectionalGraph, GraphRef >::in_edge_iterator

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef transform_iterator<detail::reverse_graph_edge_descriptor_maker<typename Traits::edge_descriptor>, typename Traits::in_edge_iterator> boost::reverse_graph< BidirectionalGraph, GraphRef >::out_edge_iterator

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef Traits::traversal_category boost::reverse_graph< BidirectionalGraph, GraphRef >::traversal_category

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef Traits::vertex_descriptor boost::reverse_graph< BidirectionalGraph, GraphRef >::vertex_descriptor

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef Traits::vertex_iterator boost::reverse_graph< BidirectionalGraph, GraphRef >::vertex_iterator

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

typedef Traits::vertices_size_type boost::reverse_graph< BidirectionalGraph, GraphRef >::vertices_size_type

Member Enumeration Documentation

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

anonymous enum

Enumerator
is_edge_list

Constructor & Destructor Documentation

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

boost::reverse_graph< BidirectionalGraph, GraphRef >::reverse_graph ( GraphRef  g )

inline

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

boost::reverse_graph< BidirectionalGraph, GraphRef >::reverse_graph ( const reverse_graph< BidirectionalGraph, BidirectionalGraph & > &  o )

inline

Member Function Documentation

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

static vertex_descriptor boost::reverse_graph< BidirectionalGraph, GraphRef >::null_vertex ( )

inlinestatic

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

template<typename Descriptor >

graph::detail::bundled_result< BidirectionalGraph, typename detail::get_underlying_descriptor_from_reverse_descriptor<Descriptor>::type >::type& boost::reverse_graph< BidirectionalGraph, GraphRef >::operator[] ( Descriptor  x )

inline

References boost::detail::get_underlying_descriptor_from_reverse_descriptor< Desc >::convert(), and boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g.

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

template<typename Descriptor >

graph::detail::bundled_result< BidirectionalGraph, typename detail::get_underlying_descriptor_from_reverse_descriptor<Descriptor>::type >::type const& boost::reverse_graph< BidirectionalGraph, GraphRef >::operator[] ( Descriptor  x ) const

inline

References boost::detail::get_underlying_descriptor_from_reverse_descriptor< Desc >::convert(), and boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g.

Member Data Documentation

template<class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>

GraphRef boost::reverse_graph< BidirectionalGraph, GraphRef >::m_g

Referenced by boost::edge(), boost::edges(), boost::get_property(), boost::in_degree(), boost::in_edges(), boost::num_edges(), boost::num_vertices(), boost::reverse_graph< BidirectionalGraph, GraphRef >::operator[](), boost::out_degree(), boost::out_edges(), boost::process_group(), boost::set_property(), boost::source(), boost::target(), boost::vertex(), and boost::vertices().

---

The documentation for this class was generated from the following file:

• boost_1_57_0/boost/graph/reverse_graph.hpp