sl@0: //  (C) Copyright David Abrahams 2000.
sl@0: // Distributed under the Boost Software License, Version 1.0. (See
sl@0: // accompanying file LICENSE_1_0.txt or copy at
sl@0: // http://www.boost.org/LICENSE_1_0.txt)
sl@0: 
sl@0: #ifndef REVERSE_GRAPH_DWA092300_H_
sl@0: # define REVERSE_GRAPH_DWA092300_H_
sl@0: 
sl@0: #include <boost/graph/adjacency_iterator.hpp>
sl@0: #include <boost/graph/properties.hpp>
sl@0: #include <boost/tuple/tuple.hpp>
sl@0: 
sl@0: namespace boost {
sl@0: 
sl@0: struct reverse_graph_tag { };
sl@0: 
sl@0:   namespace detail {
sl@0: 
sl@0:     template <bool isEdgeList> struct choose_rev_edge_iter { };
sl@0:     template <> struct choose_rev_edge_iter<true> {
sl@0:       template <class G> struct bind_ {
sl@0:         typedef typename graph_traits<G>::edge_iterator type;
sl@0:       };
sl@0:     };
sl@0:     template <> struct choose_rev_edge_iter<false> {
sl@0:       template <class G> struct bind_ {
sl@0:         typedef void type;
sl@0:       };
sl@0:     };
sl@0: 
sl@0:   } // namespace detail
sl@0: 
sl@0: template <class BidirectionalGraph, class GraphRef = const BidirectionalGraph&>
sl@0: class reverse_graph {
sl@0:     typedef reverse_graph<BidirectionalGraph, GraphRef> Self;
sl@0:     typedef graph_traits<BidirectionalGraph> Traits;
sl@0:  public:
sl@0:     typedef BidirectionalGraph base_type;
sl@0: 
sl@0:     // Constructor
sl@0:     reverse_graph(GraphRef g) : m_g(g) {}
sl@0: 
sl@0:     // Graph requirements
sl@0:     typedef typename Traits::vertex_descriptor vertex_descriptor;
sl@0:     typedef typename Traits::edge_descriptor edge_descriptor;
sl@0:     typedef typename Traits::directed_category directed_category;
sl@0:     typedef typename Traits::edge_parallel_category edge_parallel_category;
sl@0:     typedef typename Traits::traversal_category traversal_category;
sl@0: 
sl@0:     // IncidenceGraph requirements
sl@0:     typedef typename Traits::in_edge_iterator out_edge_iterator;
sl@0:     typedef typename Traits::degree_size_type degree_size_type;
sl@0: 
sl@0:     // BidirectionalGraph requirements
sl@0:     typedef typename Traits::out_edge_iterator in_edge_iterator;
sl@0: 
sl@0:     // AdjacencyGraph requirements
sl@0:   typedef typename adjacency_iterator_generator<Self,
sl@0:     vertex_descriptor, out_edge_iterator>::type adjacency_iterator;
sl@0: 
sl@0:     // VertexListGraph requirements
sl@0:     typedef typename Traits::vertex_iterator vertex_iterator;
sl@0: 
sl@0:     // EdgeListGraph requirements
sl@0:     enum { is_edge_list = is_convertible<traversal_category,
sl@0:            edge_list_graph_tag>::value };
sl@0:     typedef detail::choose_rev_edge_iter<is_edge_list> ChooseEdgeIter;
sl@0:     typedef typename ChooseEdgeIter::
sl@0:       template bind_<BidirectionalGraph>::type   edge_iterator;
sl@0:     typedef typename Traits::vertices_size_type vertices_size_type;
sl@0:     typedef typename Traits::edges_size_type edges_size_type;
sl@0: 
sl@0:     // More typedefs used by detail::edge_property_map, vertex_property_map
sl@0:     typedef typename BidirectionalGraph::edge_property_type
sl@0:       edge_property_type;
sl@0:     typedef typename BidirectionalGraph::vertex_property_type
sl@0:       vertex_property_type;
sl@0:     typedef reverse_graph_tag graph_tag;
sl@0: 
sl@0: #ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES
sl@0:     // Bundled properties support
sl@0:     template<typename Descriptor>
sl@0:     typename graph::detail::bundled_result<BidirectionalGraph, 
sl@0:                                            Descriptor>::type&
sl@0:     operator[](Descriptor x)
sl@0:     { return m_g[x]; }
sl@0: 
sl@0:     template<typename Descriptor>
sl@0:     typename graph::detail::bundled_result<BidirectionalGraph, 
sl@0:                                            Descriptor>::type const&
sl@0:     operator[](Descriptor x) const
sl@0:     { return m_g[x]; }
sl@0: #endif // BOOST_GRAPH_NO_BUNDLED_PROPERTIES
sl@0: 
sl@0:     static vertex_descriptor null_vertex()
sl@0:     { return Traits::null_vertex(); }
sl@0: 
sl@0:     // would be private, but template friends aren't portable enough.
sl@0:  // private:
sl@0:     GraphRef m_g;
sl@0: };
sl@0: 
sl@0: #ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES
sl@0:   template<typename Graph, typename GraphRef>
sl@0:   struct vertex_bundle_type<reverse_graph<Graph, GraphRef> > 
sl@0:     : vertex_bundle_type<Graph> { };
sl@0: 
sl@0:   template<typename Graph, typename GraphRef>
sl@0:   struct edge_bundle_type<reverse_graph<Graph, GraphRef> > 
sl@0:     : edge_bundle_type<Graph> { };
sl@0: #endif // BOOST_GRAPH_NO_BUNDLED_PROPERTIES
sl@0: 
sl@0: template <class BidirectionalGraph>
sl@0: inline reverse_graph<BidirectionalGraph>
sl@0: make_reverse_graph(const BidirectionalGraph& g)
sl@0: {
sl@0:     return reverse_graph<BidirectionalGraph>(g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph>
sl@0: inline reverse_graph<BidirectionalGraph, BidirectionalGraph&>
sl@0: make_reverse_graph(BidirectionalGraph& g)
sl@0: {
sl@0:     return reverse_graph<BidirectionalGraph, BidirectionalGraph&>(g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: std::pair<typename reverse_graph<BidirectionalGraph>::vertex_iterator,
sl@0:           typename reverse_graph<BidirectionalGraph>::vertex_iterator>
sl@0: vertices(const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return vertices(g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: std::pair<typename reverse_graph<BidirectionalGraph>::edge_iterator,
sl@0:           typename reverse_graph<BidirectionalGraph>::edge_iterator>
sl@0: edges(const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return edges(g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: inline std::pair<typename BidirectionalGraph::in_edge_iterator,
sl@0:                  typename BidirectionalGraph::in_edge_iterator>
sl@0: out_edges(const typename BidirectionalGraph::vertex_descriptor u,
sl@0:           const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return in_edges(u, g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: inline typename BidirectionalGraph::vertices_size_type
sl@0: num_vertices(const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return num_vertices(g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: inline typename reverse_graph<BidirectionalGraph>::edges_size_type
sl@0: num_edges(const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return num_edges(g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: inline typename BidirectionalGraph::degree_size_type
sl@0: out_degree(const typename BidirectionalGraph::vertex_descriptor u,
sl@0:            const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return in_degree(u, g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: inline std::pair<typename BidirectionalGraph::edge_descriptor, bool>
sl@0: edge(const typename BidirectionalGraph::vertex_descriptor u,
sl@0:      const typename BidirectionalGraph::vertex_descriptor v,
sl@0:      const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return edge(v, u, g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: inline std::pair<typename BidirectionalGraph::out_edge_iterator,
sl@0:     typename BidirectionalGraph::out_edge_iterator>
sl@0: in_edges(const typename BidirectionalGraph::vertex_descriptor u,
sl@0:          const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return out_edges(u, g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: inline std::pair<typename reverse_graph<BidirectionalGraph,GRef>::adjacency_iterator,
sl@0:     typename reverse_graph<BidirectionalGraph,GRef>::adjacency_iterator>
sl@0: adjacent_vertices(const typename BidirectionalGraph::vertex_descriptor u,
sl@0:                   const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     typedef reverse_graph<BidirectionalGraph,GRef> Graph;
sl@0:     typename Graph::out_edge_iterator first, last;
sl@0:     tie(first, last) = out_edges(u, g);
sl@0:     typedef typename Graph::adjacency_iterator adjacency_iterator;
sl@0:     return std::make_pair(adjacency_iterator(first, const_cast<Graph*>(&g)),
sl@0:                           adjacency_iterator(last, const_cast<Graph*>(&g)));
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef>
sl@0: inline typename BidirectionalGraph::degree_size_type
sl@0: in_degree(const typename BidirectionalGraph::vertex_descriptor u,
sl@0:           const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return out_degree(u, g.m_g);
sl@0: }
sl@0: 
sl@0: template <class Edge, class BidirectionalGraph, class GRef>
sl@0: inline typename graph_traits<BidirectionalGraph>::vertex_descriptor
sl@0: source(const Edge& e, const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return target(e, g.m_g);
sl@0: }
sl@0: 
sl@0: template <class Edge, class BidirectionalGraph, class GRef>
sl@0: inline typename graph_traits<BidirectionalGraph>::vertex_descriptor
sl@0: target(const Edge& e, const reverse_graph<BidirectionalGraph,GRef>& g)
sl@0: {
sl@0:     return source(e, g.m_g);
sl@0: }
sl@0: 
sl@0: 
sl@0: namespace detail {
sl@0: 
sl@0:   struct reverse_graph_vertex_property_selector {
sl@0:     template <class ReverseGraph, class Property, class Tag>
sl@0:     struct bind_ {
sl@0:       typedef typename ReverseGraph::base_type Graph;
sl@0:       typedef property_map<Graph, Tag> PMap;
sl@0:       typedef typename PMap::type type;
sl@0:       typedef typename PMap::const_type const_type;
sl@0:     };
sl@0:   };
sl@0: 
sl@0:   struct reverse_graph_edge_property_selector {
sl@0:     template <class ReverseGraph, class Property, class Tag>
sl@0:     struct bind_ {
sl@0:       typedef typename ReverseGraph::base_type Graph;
sl@0:       typedef property_map<Graph, Tag> PMap;
sl@0:       typedef typename PMap::type type;
sl@0:       typedef typename PMap::const_type const_type;
sl@0:     };
sl@0:   };
sl@0: 
sl@0: } // namespace detail
sl@0: 
sl@0: template <>
sl@0: struct vertex_property_selector<reverse_graph_tag> {
sl@0:   typedef detail::reverse_graph_vertex_property_selector type;
sl@0: };
sl@0: 
sl@0: template <>
sl@0: struct edge_property_selector<reverse_graph_tag> {
sl@0:   typedef detail::reverse_graph_edge_property_selector type;
sl@0: };
sl@0: 
sl@0: template <class BidirGraph, class GRef, class Property>
sl@0: typename property_map<BidirGraph, Property>::type
sl@0: get(Property p, reverse_graph<BidirGraph,GRef>& g)
sl@0: {
sl@0:   return get(p, g.m_g);
sl@0: }
sl@0: 
sl@0: template <class BidirGraph, class GRef, class Property>
sl@0: typename property_map<BidirGraph, Property>::const_type
sl@0: get(Property p, const reverse_graph<BidirGraph,GRef>& g)
sl@0: {
sl@0:   const BidirGraph& gref = g.m_g; // in case GRef is non-const
sl@0:   return get(p, gref);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef, class Property, class Key>
sl@0: typename property_traits<
sl@0:   typename property_map<BidirectionalGraph, Property>::const_type
sl@0: >::value_type
sl@0: get(Property p, const reverse_graph<BidirectionalGraph,GRef>& g, const Key& k)
sl@0: {
sl@0:   return get(p, g.m_g, k);
sl@0: }
sl@0: 
sl@0: template <class BidirectionalGraph, class GRef, class Property, class Key, class Value>
sl@0: void
sl@0: put(Property p, const reverse_graph<BidirectionalGraph,GRef>& g, const Key& k,
sl@0:     const Value& val)
sl@0: {
sl@0:   put(p, g.m_g, k, val);
sl@0: }
sl@0: 
sl@0: template<typename BidirectionalGraph, typename GRef, typename Tag,
sl@0:          typename Value>
sl@0: inline void
sl@0: set_property(const reverse_graph<BidirectionalGraph,GRef>& g, Tag tag, 
sl@0:              const Value& value)
sl@0: {
sl@0:   set_property(g.m_g, tag, value);
sl@0: }
sl@0: 
sl@0: template<typename BidirectionalGraph, typename GRef, typename Tag>
sl@0: inline
sl@0: typename graph_property<BidirectionalGraph, Tag>::type
sl@0: get_property(const reverse_graph<BidirectionalGraph,GRef>& g, Tag tag)
sl@0: {
sl@0:   return get_property(g.m_g, tag);
sl@0: }
sl@0: 
sl@0: } // namespace boost
sl@0: 
sl@0: #endif