Milena (Olena)
User documentation 2.0a Id
|
00001 // Copyright (C) 2009 EPITA Research and Development Laboratory (LRDE) 00002 // 00003 // This file is part of Olena. 00004 // 00005 // Olena is free software: you can redistribute it and/or modify it under 00006 // the terms of the GNU General Public License as published by the Free 00007 // Software Foundation, version 2 of the License. 00008 // 00009 // Olena is distributed in the hope that it will be useful, 00010 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00011 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00012 // General Public License for more details. 00013 // 00014 // You should have received a copy of the GNU General Public License 00015 // along with Olena. If not, see <http://www.gnu.org/licenses/>. 00016 // 00017 // As a special exception, you may use this file as part of a free 00018 // software project without restriction. Specifically, if other files 00019 // instantiate templates or use macros or inline functions from this 00020 // file, or you compile this file and link it with other files to produce 00021 // an executable, this file does not by itself cause the resulting 00022 // executable to be covered by the GNU General Public License. This 00023 // exception does not however invalidate any other reasons why the 00024 // executable file might be covered by the GNU General Public License. 00025 00026 #include <mln/core/alias/neighb2d.hh> 00027 00028 #include <mln/util/graph.hh> 00029 00030 #include <mln/value/label_8.hh> 00031 00032 #include <mln/make/image2d.hh> 00033 #include <mln/make/rag_and_labeled_wsl.hh> 00034 00035 # include <mln/debug/println.hh> 00036 00037 int main() 00038 { 00039 using namespace mln; 00040 00041 value::label_8 vals[16] = { 1, 0, 3, 3, 00042 1, 0, 0, 0, 00043 0, 0, 4, 4, 00044 2, 2, 0, 4 }; 00045 00046 typedef image2d<value::label_8> wst_t; 00047 wst_t ima = make::image2d(vals); 00048 00049 util::couple<util::graph, wst_t> 00050 res = make::rag_and_labeled_wsl(ima, c4(), 4u); 00051 00052 wst_t& lwsl = res.second(); 00053 util::graph& g = res.first(); 00054 00055 // check that adjacency labels map edge labels. 00056 mln_piter_(wst_t) p(lwsl.domain()); 00057 mln_niter_(neighb2d) n(c4(),p); 00058 for_all(p) 00059 if (lwsl(p) != mln_max(value::label_8).prev()) 00060 { 00061 value::label_8 l1 = 0, l2 = 0; 00062 for_all(n) 00063 if (ima.has(n) && ima(n) != 0u) 00064 { 00065 if (l1 == 0u) // First label to be stored. 00066 l1 = ima(n); 00067 else 00068 if (ima(n) != l1) // Useless: && l2 == 0) 00069 { // Second label to be stored. 00070 mln_invariant(l2 == 0u); 00071 l2 = ima(n); 00072 break; 00073 } 00074 } 00075 if (l2 < l1) 00076 std::swap(l1, l2); 00077 mln_assertion(g.v1(lwsl(p)) == l1); 00078 mln_assertion(g.v2(lwsl(p)) == l2); 00079 } 00080 00081 mln_assertion(g.e_nmax() == 4u); 00082 mln_assertion(g.v_nmax() == 5u); 00083 mln_assertion(g.v_nmax_nbh_edges(0) == 0); 00084 for (unsigned i = 1; i < 4; ++i) 00085 mln_assertion(g.v_nmax_nbh_edges(i) == 2); 00086 }