$extrastylesheet
Olena  User documentation 2.1
An Image Processing Platform
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
p_edges.cc
1 // Copyright (C) 2008, 2009 EPITA Research and Development Laboratory (LRDE)
2 //
3 // This file is part of Olena.
4 //
5 // Olena is free software: you can redistribute it and/or modify it under
6 // the terms of the GNU General Public License as published by the Free
7 // Software Foundation, version 2 of the License.
8 //
9 // Olena is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 // General Public License for more details.
13 //
14 // You should have received a copy of the GNU General Public License
15 // along with Olena. If not, see <http://www.gnu.org/licenses/>.
16 //
17 // As a special exception, you may use this file as part of a free
18 // software project without restriction. Specifically, if other files
19 // instantiate templates or use macros or inline functions from this
20 // file, or you compile this file and link it with other files to produce
21 // an executable, this file does not by itself cause the resulting
22 // executable to be covered by the GNU General Public License. This
23 // exception does not however invalidate any other reasons why the
24 // executable file might be covered by the GNU General Public License.
25 
26 #include <mln/util/graph.hh>
27 #include <mln/core/alias/point2d.hh>
28 #include <mln/core/site_set/p_edges.hh>
29 
30 
31 // Function mapping an edge to a specific site.
32 
33 template <typename G>
34 struct my_fun : mln::Function< my_fun<G> >
35 {
36  typedef mln::point2d result;
37 
38  const result& operator()(unsigned v) const
39  {
40  static mln::point2d res(0, 0);
41  res.row() = v;
42  return res;
43  }
44 };
45 
46 
47 int main()
48 {
49  using namespace mln;
50 
51  // Create a graph.
52  util::graph g;
53  g.add_vertex(); // 0
54  g.add_vertex(); // 1
55  g.add_vertex(); // 2
56  g.add_vertex(); // 3
57  g.add_vertex(); // 4
58  g.add_vertex(); // 5
59  g.add_edge(0, 1);
60  g.add_edge(0, 2);
61  g.add_edge(3, 4);
62  g.add_edge(4, 5);
63  g.add_edge(5, 4);
64  g.add_edge(1, 0);
65  g.add_edge(5, 3);
66  g.add_edge(2, 1);
67 
69  p_edges pv(g, my_fun<util::graph>());
70 
71  // Forward iterator.
72  {
73  mln_fwd_piter_(p_edges) p(pv);
74  unsigned i = 0;
75  for_all(p)
76  mln_assertion(p.p_hook_().e().id() == i++);
77  mln_assertion(i == g.e_nmax());
78  }
79 
80  // Backward iterator.
81  {
82  mln_bkd_piter_(p_edges) p(pv);
83  unsigned i = g.e_nmax() - 1;
84  for_all(p)
85  mln_assertion(p.p_hook_().e().id() == i--);
86  mln_assertion(i == mln_max(unsigned));
87  }
88 
89 }