63e88f80
 Hu Chunming
提交三方库
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
//
//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#ifndef BOOST_GRAPH_DETAIL_EDGE_HPP
#define BOOST_GRAPH_DETAIL_EDGE_HPP
#include <iosfwd>
#include <boost/functional/hash.hpp>
namespace boost
{
namespace detail
{
template < typename Directed, typename Vertex > struct edge_base
{
inline edge_base() {}
inline edge_base(Vertex s, Vertex d) : m_source(s), m_target(d) {}
Vertex m_source;
Vertex m_target;
};
template < typename Directed, typename Vertex >
class edge_desc_impl : public edge_base< Directed, Vertex >
{
typedef edge_desc_impl self;
typedef edge_base< Directed, Vertex > Base;
public:
typedef void property_type;
inline edge_desc_impl() : m_eproperty(0) {}
inline edge_desc_impl(Vertex s, Vertex d, const property_type* eplug)
: Base(s, d), m_eproperty(const_cast< property_type* >(eplug))
{
}
property_type* get_property() { return m_eproperty; }
const property_type* get_property() const { return m_eproperty; }
// protected:
property_type* m_eproperty;
};
template < class D, class V >
inline bool operator==(const detail::edge_desc_impl< D, V >& a,
const detail::edge_desc_impl< D, V >& b)
{
return a.get_property() == b.get_property();
}
template < class D, class V >
inline bool operator!=(const detail::edge_desc_impl< D, V >& a,
const detail::edge_desc_impl< D, V >& b)
{
return !(a.get_property() == b.get_property());
}
// Order edges according to the address of their property object
template < class D, class V >
inline bool operator<(const detail::edge_desc_impl< D, V >& a,
const detail::edge_desc_impl< D, V >& b)
{
return a.get_property() < b.get_property();
}
template < class D, class V >
inline bool operator<=(const detail::edge_desc_impl< D, V >& a,
const detail::edge_desc_impl< D, V >& b)
{
return a.get_property() <= b.get_property();
}
template < class D, class V >
inline bool operator>(const detail::edge_desc_impl< D, V >& a,
const detail::edge_desc_impl< D, V >& b)
{
return a.get_property() > b.get_property();
}
template < class D, class V >
inline bool operator>=(const detail::edge_desc_impl< D, V >& a,
const detail::edge_desc_impl< D, V >& b)
{
return a.get_property() >= b.get_property();
}
} // namespace detail
} // namespace boost
namespace std
{
template < class Char, class Traits, class D, class V >
std::basic_ostream< Char, Traits >& operator<<(
std::basic_ostream< Char, Traits >& os,
const boost::detail::edge_desc_impl< D, V >& e)
{
return os << "(" << e.m_source << "," << e.m_target << ")";
}
}
// Boost's functional/hash
namespace boost
{
template < typename D, typename V >
struct hash< boost::detail::edge_desc_impl< D, V > >
{
std::size_t operator()(const boost::detail::edge_desc_impl< D, V >& x) const
{
return hash_value(x.get_property());
}
};
}
#endif // BOOST_GRAPH_DETAIL_DETAIL_EDGE_HPP
|
