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
|
// Copyright (c) 2013 GeometryFactory (France). All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v5.2/BGL/include/CGAL/boost/graph/backward_compatibility_functions.h $
// $Id: backward_compatibility_functions.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Andreas Fabri
#ifndef CGAL_BOOST_GRAPH_BACKWARD_COMPATIBILITY_FUNCTIONS_H
#define CGAL_BOOST_GRAPH_BACKWARD_COMPATIBILITY_FUNCTIONS_H
namespace CGAL {
template<class Graph>
typename boost::graph_traits<Graph>::edge_descriptor
opposite_edge(typename boost::graph_traits<Graph>::edge_descriptor e
, const Graph& g)
{
typename boost::graph_traits<Graph>::halfedge_descriptor h = halfedge(e, g);
return edge(opposite(h,g), g);
}
template<class Graph>
typename boost::graph_traits<Graph>::edge_descriptor
next_edge(typename boost::graph_traits<Graph>::edge_descriptor e
, const Graph& g)
{
typename boost::graph_traits<Graph>::halfedge_descriptor h = halfedge(e, g);
return edge(next(h, g), g);
}
template<class Graph>
typename boost::graph_traits<Graph>::edge_descriptor
next_edge_cw(typename boost::graph_traits<Graph>::edge_descriptor e
, const Graph& g)
{
typename boost::graph_traits<Graph>::halfedge_descriptor h = halfedge(e, g);
return edge(opposite(next(h, g), g), g);
}
template<class Graph>
typename boost::graph_traits<Graph>::edge_descriptor
next_edge_ccw(typename boost::graph_traits<Graph>::edge_descriptor e
, const Graph& g)
{
typename boost::graph_traits<Graph>::halfedge_descriptor h = halfedge(e, g);
return edge(prev(opposite(h, g), g), g);
}
template <class Graph>
struct halfedge_graph_traits;
template<class Graph>
std::pair<typename CGAL::halfedge_graph_traits<Graph>::undirected_edge_iterator, typename CGAL::halfedge_graph_traits<Graph>::undirected_edge_iterator>
undirected_edges(const Graph& g)
{
return edges(g);
}
} //end of namespace CGAL
#endif //CGAL_BOOST_GRAPH_BACKWARD_COMPATIBILITY_FUNCTIONS_H
|
