$extrastylesheet
Olena  User documentation 2.1
An Image Processing Platform
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
dummy_p_vertices.cc
1 // Copyright (C) 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/core/image/image2d.hh>
27 #include <mln/core/site_set/p_array.hh>
28 
29 #include <mln/util/graph.hh>
30 
31 #include <mln/value/label_8.hh>
32 
33 #include <mln/make/dummy_p_vertices.hh>
34 
35 int main()
36 {
37  using namespace mln;
38 
39  typedef util::graph G;
40  G g;
41  g.add_vertices(5);
42  g.add_edge(1,2);
43  g.add_edge(1,3);
44  g.add_edge(4,3);
45  g.add_edge(4,2);
46 
47  {
48  typedef p_vertices<G> pe_t;
49  pe_t pe = make::dummy_p_vertices(g);
50  unsigned i = 0;
51 
52  mln_assertion(pe.nsites() == 5);
53  mln_piter_(pe_t) p(pe);
54  for_all(p)
55  mln_assertion(p.id() == i++);
56  }
57 
58  {
59  typedef p_vertices<G, pw::cst_<point2d> > pe_t;
61 
62  mln_assertion(pe.nsites() == 5);
63  mln_piter_(pe_t) p(pe);
64  for_all(p)
65  mln_assertion(p == point2d::plus_infty());
66  }
67 
68 }