boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-31 20:22:09 +00:00
Code Issues Projects Releases Wiki Activity

fixed bugs, added source() and target().

Browse Source 
[SVN r7839]
This commit is contained in:
Dave Abrahams
2000-09-25 22:25:02 +00:00
parent 02f42466f0
commit 061c2a9aaa
1 changed files with 22 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
include/boost/graph/reverse_graph.hpp
View File

@@ -37,6 +37,12 @@ class reverse_graph {
typedef typename graph_traits<BidirectionalGraph>::edge_iterator edge_iterator;
typedef typename graph_traits<BidirectionalGraph>::vertices_size_type vertices_size_type;
typedef typename graph_traits<BidirectionalGraph>::edges_size_type edges_size_type;
// More of the same [?] used by detail::edge_property_map, vertex_property_map
typedef typename BidirectionalGraph::edge_property_type edge_property_type;
typedef typename BidirectionalGraph::vertex_property_type vertex_property_type;
typedef typename BidirectionalGraph::graph_tag graph_tag;
// would be private, but template friends aren't portable enough.
// private:
@@ -132,8 +138,8 @@ edge(const typename BidirectionalGraph::vertex_descriptor u,
}
template <class BidirectionalGraph>
inline std::pair<typename BidirectionalGraph::in_edge_iterator,
typename BidirectionalGraph::in_edge_iterator>
inline std::pair<typename BidirectionalGraph::out_edge_iterator,
typename BidirectionalGraph::out_edge_iterator>
in_edges(const typename BidirectionalGraph::vertex_descriptor u,
const reverse_graph<BidirectionalGraph>& g)
{
@@ -148,6 +154,20 @@ in_degree(const typename BidirectionalGraph::vertex_descriptor u,
return out_degree(u, g.m_g);
}
template <class Edge, class BidirectionalGraph>
inline typename graph_traits<BidirectionalGraph>::vertex_descriptor
source(const Edge& e, const reverse_graph<BidirectionalGraph>& g)
{
return target(e, g.m_g);
}
template <class Edge, class BidirectionalGraph>
inline typename graph_traits<BidirectionalGraph>::vertex_descriptor
target(const Edge& e, const reverse_graph<BidirectionalGraph>& g)
{
return source(e, g.m_g);
}
} // namespace boost
#endif