$extrastylesheet
Olena  User documentation 2.1
An Image Processing Platform
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
p_vertices.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_vertices.hh>
29 #include <mln/fun/i2v/array.hh>
30 
31 
32 int main()
33 {
34  using namespace mln;
35 
36  util::graph g;
37  g.add_vertex(); // 0
38  g.add_vertex(); // 1
39  g.add_vertex(); // 2
40  g.add_vertex(); // 3
41  g.add_vertex(); // 4
42  g.add_vertex(); // 5
43  g.add_edge(0, 1);
44  g.add_edge(0, 2);
45  g.add_edge(3, 4);
46  g.add_edge(4, 5);
47  g.add_edge(5, 4);
48  g.add_edge(1, 0);
49  g.add_edge(5, 3);
50  g.add_edge(2, 1);
51 
52  // Map vertices to sites.
53  typedef fun::i2v::array<point2d> F;
54  F f(6);
55  for (unsigned i = 0; i < 6; ++i)
56  f(i) = point2d(i, 0);
57 
59  p_vertices pv(g, f);
60 
61  // Forward iterator.
62  {
63  mln_fwd_piter_(p_vertices) p(pv);
64  unsigned i = 0;
65  for_all(p)
66  mln_assertion(p.p_hook_().v().id() == i++);
67  mln_assertion(i == g.v_nmax());
68  }
69 
70  // Backward iterator.
71  {
72  mln_bkd_piter_(p_vertices) p(pv);
73  unsigned i = g.v_nmax() - 1;
74  for_all(p)
75  mln_assertion(p.p_hook_().v().id() == i--);
76  mln_assertion(i == mln_max(unsigned));
77  }
78 
79 }