MCPcopy Create free account
hub / github.com/CGAL/cgal / Edge

Class Edge

BGL/include/CGAL/boost/graph/iterator.h:32–50  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

30
31template <typename G>
32struct Edge {
33 const G* g;
34
35 Edge()
36 : g(nullptr)
37 {}
38
39 Edge(const G& g)
40 : g(&g)
41 {}
42
43 typedef typename boost::graph_traits<G>::edge_descriptor result_type;
44 typedef typename boost::graph_traits<G>::halfedge_descriptor argument_type;
45
46 result_type operator()(argument_type h) const
47 {
48 return edge(h, *g);
49 }
50};
51
52template <typename G>
53struct Opposite_edge {

Callers 15

CGAL_For_allMethod · 0.50
get_copy_edgeMethod · 0.50
random_finite_edgeMethod · 0.50
twin_edgeMethod · 0.50
next_edgeMethod · 0.50
prev_edgeMethod · 0.50
fill_queueMethod · 0.50
run_nb_splitsMethod · 0.50
operator()Method · 0.50
resultMethod · 0.50

Calls

no outgoing calls

Tested by 6

test_dual_graph_conceptFunction · 0.40
oppositeMethod · 0.40
operator()Method · 0.40
oppositeMethod · 0.40
operator()Method · 0.40
test_anchor_delFunction · 0.40