|
sl@0
|
1 |
//
|
|
sl@0
|
2 |
//=======================================================================
|
|
sl@0
|
3 |
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
|
|
sl@0
|
4 |
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
|
|
sl@0
|
5 |
//
|
|
sl@0
|
6 |
// Distributed under the Boost Software License, Version 1.0. (See
|
|
sl@0
|
7 |
// accompanying file LICENSE_1_0.txt or copy at
|
|
sl@0
|
8 |
// http://www.boost.org/LICENSE_1_0.txt)
|
|
sl@0
|
9 |
//=======================================================================
|
|
sl@0
|
10 |
|
|
sl@0
|
11 |
#ifndef BOOST_GRAPH_DETAIL_EDGE_HPP
|
|
sl@0
|
12 |
#define BOOST_GRAPH_DETAIL_EDGE_HPP
|
|
sl@0
|
13 |
|
|
sl@0
|
14 |
#if __GNUC__ < 3
|
|
sl@0
|
15 |
#include <iostream>
|
|
sl@0
|
16 |
#else
|
|
sl@0
|
17 |
#include <iosfwd>
|
|
sl@0
|
18 |
#endif
|
|
sl@0
|
19 |
|
|
sl@0
|
20 |
namespace boost {
|
|
sl@0
|
21 |
|
|
sl@0
|
22 |
namespace detail {
|
|
sl@0
|
23 |
|
|
sl@0
|
24 |
template <typename Directed, typename Vertex>
|
|
sl@0
|
25 |
struct edge_base
|
|
sl@0
|
26 |
{
|
|
sl@0
|
27 |
inline edge_base() {}
|
|
sl@0
|
28 |
inline edge_base(Vertex s, Vertex d)
|
|
sl@0
|
29 |
: m_source(s), m_target(d) { }
|
|
sl@0
|
30 |
Vertex m_source;
|
|
sl@0
|
31 |
Vertex m_target;
|
|
sl@0
|
32 |
};
|
|
sl@0
|
33 |
|
|
sl@0
|
34 |
template <typename Directed, typename Vertex>
|
|
sl@0
|
35 |
class edge_desc_impl : public edge_base<Directed,Vertex> {
|
|
sl@0
|
36 |
typedef edge_desc_impl self;
|
|
sl@0
|
37 |
typedef edge_base<Directed,Vertex> Base;
|
|
sl@0
|
38 |
public:
|
|
sl@0
|
39 |
typedef void property_type;
|
|
sl@0
|
40 |
|
|
sl@0
|
41 |
inline edge_desc_impl() : m_eproperty(0) {}
|
|
sl@0
|
42 |
|
|
sl@0
|
43 |
inline edge_desc_impl(Vertex s, Vertex d, const property_type* eplug)
|
|
sl@0
|
44 |
: Base(s,d), m_eproperty(const_cast<property_type*>(eplug)) { }
|
|
sl@0
|
45 |
|
|
sl@0
|
46 |
property_type* get_property() { return m_eproperty; }
|
|
sl@0
|
47 |
const property_type* get_property() const { return m_eproperty; }
|
|
sl@0
|
48 |
|
|
sl@0
|
49 |
// protected:
|
|
sl@0
|
50 |
property_type* m_eproperty;
|
|
sl@0
|
51 |
};
|
|
sl@0
|
52 |
|
|
sl@0
|
53 |
template <class D, class V>
|
|
sl@0
|
54 |
inline bool
|
|
sl@0
|
55 |
operator==(const detail::edge_desc_impl<D,V>& a,
|
|
sl@0
|
56 |
const detail::edge_desc_impl<D,V>& b)
|
|
sl@0
|
57 |
{
|
|
sl@0
|
58 |
return a.get_property() == b.get_property();
|
|
sl@0
|
59 |
}
|
|
sl@0
|
60 |
template <class D, class V>
|
|
sl@0
|
61 |
inline bool
|
|
sl@0
|
62 |
operator!=(const detail::edge_desc_impl<D,V>& a,
|
|
sl@0
|
63 |
const detail::edge_desc_impl<D,V>& b)
|
|
sl@0
|
64 |
{
|
|
sl@0
|
65 |
return ! (a.get_property() == b.get_property());
|
|
sl@0
|
66 |
}
|
|
sl@0
|
67 |
|
|
sl@0
|
68 |
} //namespace detail
|
|
sl@0
|
69 |
|
|
sl@0
|
70 |
} // namespace boost
|
|
sl@0
|
71 |
|
|
sl@0
|
72 |
namespace std {
|
|
sl@0
|
73 |
|
|
sl@0
|
74 |
#if __GNUC__ < 3
|
|
sl@0
|
75 |
template <class D, class V>
|
|
sl@0
|
76 |
std::ostream&
|
|
sl@0
|
77 |
operator<<(std::ostream& os, const boost::detail::edge_desc_impl<D,V>& e)
|
|
sl@0
|
78 |
{
|
|
sl@0
|
79 |
return os << "(" << e.m_source << "," << e.m_target << ")";
|
|
sl@0
|
80 |
}
|
|
sl@0
|
81 |
#else
|
|
sl@0
|
82 |
template <class Char, class Traits, class D, class V>
|
|
sl@0
|
83 |
std::basic_ostream<Char, Traits>&
|
|
sl@0
|
84 |
operator<<(std::basic_ostream<Char, Traits>& os,
|
|
sl@0
|
85 |
const boost::detail::edge_desc_impl<D,V>& e)
|
|
sl@0
|
86 |
{
|
|
sl@0
|
87 |
return os << "(" << e.m_source << "," << e.m_target << ")";
|
|
sl@0
|
88 |
}
|
|
sl@0
|
89 |
#endif
|
|
sl@0
|
90 |
|
|
sl@0
|
91 |
}
|
|
sl@0
|
92 |
|
|
sl@0
|
93 |
|
|
sl@0
|
94 |
#endif // BOOST_GRAPH_DETAIL_DETAIL_EDGE_HPP
|