reverse_graph.hpp File Reference

#include <boost/graph/adjacency_iterator.hpp>
#include <boost/graph/properties.hpp>
#include <boost/iterator/transform_iterator.hpp>
#include <boost/tuple/tuple.hpp>
#include <boost/type_traits.hpp>
#include <boost/mpl/if.hpp>

Include dependency graph for reverse_graph.hpp:

This graph shows which files directly or indirectly include this file:

Classes
struct	boost::reverse_graph_tag
class	boost::detail::reverse_graph_edge_descriptor< EdgeDesc >
struct	boost::detail::reverse_graph_edge_descriptor_maker< EdgeDesc >
struct	boost::detail::get_underlying_descriptor_from_reverse_descriptor< Desc >
struct	boost::detail::get_underlying_descriptor_from_reverse_descriptor< reverse_graph_edge_descriptor< Desc > >
struct	boost::detail::choose_rev_edge_iter< isEdgeList >
struct	boost::detail::choose_rev_edge_iter< true >
struct	boost::detail::choose_rev_edge_iter< true >::bind_< G >
struct	boost::detail::choose_rev_edge_iter< false >
struct	boost::detail::choose_rev_edge_iter< false >::bind_< G >
class	boost::reverse_graph< BidirectionalGraph, GraphRef >
struct	boost::vertex_property_type< reverse_graph< BidirectionalGraph, GraphRef > >
struct	boost::edge_property_type< reverse_graph< BidirectionalGraph, GraphRef > >
struct	boost::graph_property_type< reverse_graph< BidirectionalGraph, GraphRef > >
struct	boost::vertex_bundle_type< reverse_graph< Graph, GraphRef > >
struct	boost::edge_bundle_type< reverse_graph< Graph, GraphRef > >
struct	boost::graph_bundle_type< reverse_graph< Graph, GraphRef > >
struct	boost::detail::reverse_graph_edge_property_map< PM >
struct	boost::property_map< reverse_graph< BidirGraph, GRef >, Property >
struct	boost::property_map< const reverse_graph< BidirGraph, GRef >, Property >
struct	boost::detail::underlying_edge_desc_map_type< E >
struct	boost::property_traits< detail::underlying_edge_desc_map_type< E > >
struct	boost::property_map< reverse_graph< Graph, GRef >, edge_underlying_t >
struct	boost::is_reverse_graph< T >
struct	boost::is_reverse_graph< reverse_graph< G, R > >

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail

Functions
template<typename EdgeDesc , typename Iter >
std::pair< transform_iterator < reverse_graph_edge_descriptor_maker < EdgeDesc >, Iter > , transform_iterator < reverse_graph_edge_descriptor_maker < EdgeDesc >, Iter > >	boost::detail::reverse_edge_iter_pair (const std::pair< Iter, Iter > &ip)
template<class BidirectionalGraph >
reverse_graph< BidirectionalGraph >	boost::make_reverse_graph (const BidirectionalGraph &g)
template<class BidirectionalGraph >
reverse_graph < BidirectionalGraph, BidirectionalGraph & >	boost::make_reverse_graph (BidirectionalGraph &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph > ::vertex_iterator, typename reverse_graph < BidirectionalGraph > ::vertex_iterator >	boost::vertices (const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph > ::edge_iterator, typename reverse_graph < BidirectionalGraph > ::edge_iterator >	boost::edges (const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph > ::out_edge_iterator, typename reverse_graph < BidirectionalGraph > ::out_edge_iterator >	boost::out_edges (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::vertices_size_type	boost::num_vertices (const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
reverse_graph < BidirectionalGraph > ::edges_size_type	boost::num_edges (const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::degree_size_type	boost::out_degree (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::vertex_descriptor	boost::vertex (const typename graph_traits< BidirectionalGraph >::vertices_size_type v, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename graph_traits< reverse_graph < BidirectionalGraph, GRef > >::edge_descriptor, bool >	boost::edge (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const typename graph_traits< BidirectionalGraph >::vertex_descriptor v, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph > ::in_edge_iterator, typename reverse_graph < BidirectionalGraph > ::in_edge_iterator >	boost::in_edges (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
std::pair< typename reverse_graph < BidirectionalGraph, GRef > ::adjacency_iterator, typename reverse_graph < BidirectionalGraph, GRef > ::adjacency_iterator >	boost::adjacent_vertices (typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::degree_size_type	boost::in_degree (const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class Edge , class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::vertex_descriptor	boost::source (const detail::reverse_graph_edge_descriptor< Edge > &e, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class Edge , class BidirectionalGraph , class GRef >
graph_traits < BidirectionalGraph > ::vertex_descriptor	boost::target (const detail::reverse_graph_edge_descriptor< Edge > &e, const reverse_graph< BidirectionalGraph, GRef > &g)
template<class BidirGraph , class GRef , class Property >
disable_if< is_same< Property, edge_underlying_t >, typename property_map< reverse_graph < BidirGraph, GRef >, Property > ::type >::type	boost::get (Property p, reverse_graph< BidirGraph, GRef > &g)
template<class BidirGraph , class GRef , class Property >
disable_if< is_same< Property, edge_underlying_t >, typename property_map< reverse_graph < BidirGraph, GRef >, Property > ::const_type >::type	boost::get (Property p, const reverse_graph< BidirGraph, GRef > &g)
template<class BidirectionalGraph , class GRef , class Property , class Key >
disable_if< is_same< Property, edge_underlying_t >, typename property_traits< typename property_map< reverse_graph < BidirectionalGraph, GRef > , Property >::const_type > ::value_type >::type	boost::get (Property p, const reverse_graph< BidirectionalGraph, GRef > &g, const Key &k)
template<class BidirectionalGraph , class GRef , class Property , class Key , class Value >
void	boost::put (Property p, reverse_graph< BidirectionalGraph, GRef > &g, const Key &k, const Value &val)
template<class E >
E	boost::detail::get (underlying_edge_desc_map_type< E > m, const reverse_graph_edge_descriptor< E > &k)
template<class G >
enable_if< is_reverse_graph< G > , detail::underlying_edge_desc_map_type < typename graph_traits < typename G::base_type > ::edge_descriptor > >::type	boost::get (edge_underlying_t, G &)
template<class G >
enable_if< is_reverse_graph< G > , typename graph_traits < typename G::base_type > ::edge_descriptor >::type	boost::get (edge_underlying_t, G &, const typename graph_traits< G >::edge_descriptor &k)
template<class G >
enable_if< is_reverse_graph< G > , detail::underlying_edge_desc_map_type < typename graph_traits < typename G::base_type > ::edge_descriptor > >::type	boost::get (edge_underlying_t, const G &)
template<class G >
enable_if< is_reverse_graph< G > , typename graph_traits < typename G::base_type > ::edge_descriptor >::type	boost::get (edge_underlying_t, const G &, const typename graph_traits< G >::edge_descriptor &k)
template<typename BidirectionalGraph , typename GRef , typename Tag , typename Value >
void	boost::set_property (const reverse_graph< BidirectionalGraph, GRef > &g, Tag tag, const Value &value)
template<typename BidirectionalGraph , typename GRef , typename Tag >
boost::mpl::if_ < boost::is_const< typename boost::remove_reference< GRef > ::type >, const typename graph_property < BidirectionalGraph, Tag > ::type &, typename graph_property < BidirectionalGraph, Tag > ::type & >::type	boost::get_property (const reverse_graph< BidirectionalGraph, GRef > &g, Tag tag)