diff --git a/eo/src/paradisEO/island/topologies/eoFullConnectivity.h b/eo/src/paradisEO/island/topologies/eoFullConnectivity.h new file mode 100644 index 00000000..7c8b2116 --- /dev/null +++ b/eo/src/paradisEO/island/topologies/eoFullConnectivity.h @@ -0,0 +1,102 @@ +// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- + +// "eoFullConnectivity.h" + +// (c) OPAC Team, LIFL, 2002 + +/* This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Cont act: cahon@lifl.fr +*/ + +#ifndef eoFullConnectivity_h +#define eoFullConnectivity_h + +#include + +/** + Each algorithm is also connected to the whole neighbouring ... +*/ + +template class eoFullConnectivity : public eoConnectivity { + +public : + + /** + Constructor + */ + + eoFullConnectivity (eoListener & _listen, + vector & _sel_neigh + ) : eoConnectivity (_listen, _sel_neigh) { + } + + virtual vector *> from () { + + listen.update () ; + + vector *> v ; + + for (int i = 0 ; i < listen.size () ; i ++) + if (i != listen.here ().number () && selected (listen [i].label ())) + v.push_back (& listen [i]) ; + + return v ; + } + + virtual vector *> to () { + + listen.update () ; + + vector *> v ; + + for (int i = 0 ; i < listen.size () ; i ++) + if (i != listen.here ().number () && selected (listen [i].label ())) + v.push_back (& listen [i]) ; + + return v ; + } + +} ; + +#endif + + + + + + + + + + + + + + + + + + + + + + + + + + + +