paradiseo-peo modifs 0.2
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@127 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
atantar
parent
0db7814751
commit
850b834510
514 changed files with 66291 additions and 0 deletions
162
trunk/paradiseo-peo/examples/html/edge__xover_8cpp-source.html
Executable file
162
trunk/paradiseo-peo/examples/html/edge__xover_8cpp-source.html
Executable file
|
|
@ -0,0 +1,162 @@
|
|||
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||||
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
|
||||
<title>ParadisEO: edge_xover.cpp Source File</title>
|
||||
<link href="doxygen.css" rel="stylesheet" type="text/css">
|
||||
<link href="tabs.css" rel="stylesheet" type="text/css">
|
||||
</head><body>
|
||||
<!-- Generated by Doxygen 1.4.7 -->
|
||||
<div class="tabs">
|
||||
<ul>
|
||||
<li><a href="main.html"><span>Main Page</span></a></li>
|
||||
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
||||
<li><a href="classes.html"><span>Classes</span></a></li>
|
||||
<li id="current"><a href="files.html"><span>Files</span></a></li>
|
||||
<li>
|
||||
<form action="search.php" method="get">
|
||||
<table cellspacing="0" cellpadding="0" border="0">
|
||||
<tr>
|
||||
<td><label> <u>S</u>earch for </label></td>
|
||||
<td><input type="text" name="query" value="" size="20" accesskey="s"/></td>
|
||||
</tr>
|
||||
</table>
|
||||
</form>
|
||||
</li>
|
||||
</ul></div>
|
||||
<h1>edge_xover.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-</span>
|
||||
<a name="l00002"></a>00002
|
||||
<a name="l00003"></a>00003 <span class="comment">// "edge_xover.cpp"</span>
|
||||
<a name="l00004"></a>00004
|
||||
<a name="l00005"></a>00005 <span class="comment">// (c) OPAC Team, LIFL, 2003</span>
|
||||
<a name="l00006"></a>00006
|
||||
<a name="l00007"></a>00007 <span class="comment">/* This library is free software; you can redistribute it and/or</span>
|
||||
<a name="l00008"></a>00008 <span class="comment"> modify it under the terms of the GNU Lesser General Public</span>
|
||||
<a name="l00009"></a>00009 <span class="comment"> License as published by the Free Software Foundation; either</span>
|
||||
<a name="l00010"></a>00010 <span class="comment"> version 2 of the License, or (at your option) any later version.</span>
|
||||
<a name="l00011"></a>00011 <span class="comment"> </span>
|
||||
<a name="l00012"></a>00012 <span class="comment"> This library is distributed in the hope that it will be useful,</span>
|
||||
<a name="l00013"></a>00013 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
|
||||
<a name="l00014"></a>00014 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
|
||||
<a name="l00015"></a>00015 <span class="comment"> Lesser General Public License for more details.</span>
|
||||
<a name="l00016"></a>00016 <span class="comment"> </span>
|
||||
<a name="l00017"></a>00017 <span class="comment"> You should have received a copy of the GNU Lesser General Public</span>
|
||||
<a name="l00018"></a>00018 <span class="comment"> License along with this library; if not, write to the Free Software</span>
|
||||
<a name="l00019"></a>00019 <span class="comment"> Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</span>
|
||||
<a name="l00020"></a>00020 <span class="comment"> </span>
|
||||
<a name="l00021"></a>00021 <span class="comment"> Contact: cahon@lifl.fr</span>
|
||||
<a name="l00022"></a>00022 <span class="comment">*/</span>
|
||||
<a name="l00023"></a>00023
|
||||
<a name="l00024"></a>00024 <span class="preprocessor">#include <assert.h></span>
|
||||
<a name="l00025"></a>00025 <span class="preprocessor">#include <values.h></span>
|
||||
<a name="l00026"></a>00026
|
||||
<a name="l00027"></a>00027 <span class="preprocessor">#include <utils/eoRNG.h></span>
|
||||
<a name="l00028"></a>00028
|
||||
<a name="l00029"></a>00029 <span class="preprocessor">#include "edge_xover.h"</span>
|
||||
<a name="l00030"></a>00030
|
||||
<a name="l00031"></a><a class="code" href="class_edge_xover.html#04de96aa1016836e0ba5f4b952a5fa16">00031</a> <span class="keywordtype">void</span> <a class="code" href="class_edge_xover.html#04de96aa1016836e0ba5f4b952a5fa16">EdgeXover :: build_map</a> (<span class="keyword">const</span> Route & __par1, <span class="keyword">const</span> Route & __par2) {
|
||||
<a name="l00032"></a>00032
|
||||
<a name="l00033"></a>00033 <span class="keywordtype">unsigned</span> len = __par1.size () ;
|
||||
<a name="l00034"></a>00034
|
||||
<a name="l00035"></a>00035 <span class="comment">/* Initialization */</span>
|
||||
<a name="l00036"></a>00036 <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a>.clear () ;
|
||||
<a name="l00037"></a>00037 <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a>.resize (len) ;
|
||||
<a name="l00038"></a>00038
|
||||
<a name="l00039"></a>00039 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0 ; i < len ; i ++) {
|
||||
<a name="l00040"></a>00040 <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a> [__par1 [i]].insert (__par1 [(i + 1) % len]) ;
|
||||
<a name="l00041"></a>00041 <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a> [__par2 [i]].insert (__par2 [(i + 1) % len]) ;
|
||||
<a name="l00042"></a>00042 <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a> [__par1 [i]].insert (__par1 [(i - 1 + len) % len]) ;
|
||||
<a name="l00043"></a>00043 <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a> [__par2 [i]].insert (__par2 [(i - 1 + len) % len]) ;
|
||||
<a name="l00044"></a>00044 }
|
||||
<a name="l00045"></a>00045
|
||||
<a name="l00046"></a>00046 <a class="code" href="class_edge_xover.html#46d4d4724cf6d660b1a7ab4a346573d4">visited</a>.clear () ;
|
||||
<a name="l00047"></a>00047 <a class="code" href="class_edge_xover.html#46d4d4724cf6d660b1a7ab4a346573d4">visited</a>.resize (len, <span class="keyword">false</span>) ;
|
||||
<a name="l00048"></a>00048 }
|
||||
<a name="l00049"></a>00049
|
||||
<a name="l00050"></a><a class="code" href="class_edge_xover.html#1b3a4c75dd9a034c81af6d89d85d30f5">00050</a> <span class="keywordtype">void</span> <a class="code" href="class_edge_xover.html#1b3a4c75dd9a034c81af6d89d85d30f5">EdgeXover :: remove_entry</a> (<span class="keywordtype">unsigned</span> __vertex, std :: vector <std :: set <unsigned> > & __map) {
|
||||
<a name="l00051"></a>00051
|
||||
<a name="l00052"></a>00052 std :: set <unsigned> & neigh = __map [__vertex] ;
|
||||
<a name="l00053"></a>00053
|
||||
<a name="l00054"></a>00054 <span class="keywordflow">for</span> (std :: set <unsigned> :: iterator it = neigh.begin () ;
|
||||
<a name="l00055"></a>00055 it != neigh.end () ;
|
||||
<a name="l00056"></a>00056 it ++)
|
||||
<a name="l00057"></a>00057 __map [* it].erase (__vertex) ;
|
||||
<a name="l00058"></a>00058
|
||||
<a name="l00059"></a>00059 }
|
||||
<a name="l00060"></a>00060
|
||||
<a name="l00061"></a><a class="code" href="class_edge_xover.html#2d3045ef503d8b16a27e11fdc23ca11c">00061</a> <span class="keywordtype">void</span> <a class="code" href="class_edge_xover.html#2d3045ef503d8b16a27e11fdc23ca11c">EdgeXover :: add_vertex</a> (<span class="keywordtype">unsigned</span> __vertex, Route & __child) {
|
||||
<a name="l00062"></a>00062
|
||||
<a name="l00063"></a>00063 <a class="code" href="class_edge_xover.html#46d4d4724cf6d660b1a7ab4a346573d4">visited</a> [__vertex] = true ;
|
||||
<a name="l00064"></a>00064 __child.push_back (__vertex) ;
|
||||
<a name="l00065"></a>00065 <a class="code" href="class_edge_xover.html#1b3a4c75dd9a034c81af6d89d85d30f5">remove_entry</a> (__vertex, <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a>) ; <span class="comment">/* Removing entries */</span>
|
||||
<a name="l00066"></a>00066 }
|
||||
<a name="l00067"></a>00067
|
||||
<a name="l00068"></a><a class="code" href="class_edge_xover.html#88c2d4c9a878454a32d56010f3dddc27">00068</a> <span class="keywordtype">void</span> <a class="code" href="class_edge_xover.html#88c2d4c9a878454a32d56010f3dddc27">EdgeXover :: cross</a> (<span class="keyword">const</span> Route & __par1, <span class="keyword">const</span> Route & __par2, Route & __child) {
|
||||
<a name="l00069"></a>00069
|
||||
<a name="l00070"></a>00070 <a class="code" href="class_edge_xover.html#04de96aa1016836e0ba5f4b952a5fa16">build_map</a> (__par1, __par2) ;
|
||||
<a name="l00071"></a>00071
|
||||
<a name="l00072"></a>00072 <span class="keywordtype">unsigned</span> len = __par1.size () ;
|
||||
<a name="l00073"></a>00073
|
||||
<a name="l00074"></a>00074 <span class="comment">/* Go ! */</span>
|
||||
<a name="l00075"></a>00075 __child.clear () ;
|
||||
<a name="l00076"></a>00076
|
||||
<a name="l00077"></a>00077 <span class="keywordtype">unsigned</span> cur_vertex = rng.random (len) ;
|
||||
<a name="l00078"></a>00078
|
||||
<a name="l00079"></a>00079 <a class="code" href="class_edge_xover.html#2d3045ef503d8b16a27e11fdc23ca11c">add_vertex</a> (cur_vertex, __child) ;
|
||||
<a name="l00080"></a>00080
|
||||
<a name="l00081"></a>00081 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 1 ; i < len ; i ++) {
|
||||
<a name="l00082"></a>00082
|
||||
<a name="l00083"></a>00083 <span class="keywordtype">unsigned</span> len_min_entry = MAXINT ;
|
||||
<a name="l00084"></a>00084
|
||||
<a name="l00085"></a>00085 std :: set <unsigned> & neigh = <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a> [cur_vertex] ;
|
||||
<a name="l00086"></a>00086
|
||||
<a name="l00087"></a>00087 <span class="keywordflow">for</span> (std :: set <unsigned> :: iterator it = neigh.begin () ;
|
||||
<a name="l00088"></a>00088 it != neigh.end () ;
|
||||
<a name="l00089"></a>00089 it ++) {
|
||||
<a name="l00090"></a>00090 <span class="keywordtype">unsigned</span> l = <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a> [* it].size () ;
|
||||
<a name="l00091"></a>00091 <span class="keywordflow">if</span> (len_min_entry > l)
|
||||
<a name="l00092"></a>00092 len_min_entry = l ;
|
||||
<a name="l00093"></a>00093 }
|
||||
<a name="l00094"></a>00094
|
||||
<a name="l00095"></a>00095 std :: vector <unsigned> cand ; <span class="comment">/* Candidates */</span>
|
||||
<a name="l00096"></a>00096
|
||||
<a name="l00097"></a>00097 <span class="keywordflow">for</span> (std :: set <unsigned> :: iterator it = neigh.begin () ;
|
||||
<a name="l00098"></a>00098 it != neigh.end () ;
|
||||
<a name="l00099"></a>00099 it ++) {
|
||||
<a name="l00100"></a>00100 <span class="keywordtype">unsigned</span> l = <a class="code" href="class_edge_xover.html#d41399c6effb54ee48c722f1e19cb3c3">_map</a> [* it].size () ;
|
||||
<a name="l00101"></a>00101 <span class="keywordflow">if</span> (len_min_entry == l)
|
||||
<a name="l00102"></a>00102 cand.push_back (* it) ;
|
||||
<a name="l00103"></a>00103 }
|
||||
<a name="l00104"></a>00104
|
||||
<a name="l00105"></a>00105 <span class="keywordflow">if</span> (! cand.size ()) {
|
||||
<a name="l00106"></a>00106
|
||||
<a name="l00107"></a>00107 <span class="comment">/* Oh no ! Implicit mutation */</span>
|
||||
<a name="l00108"></a>00108 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0 ; j < len ; j ++)
|
||||
<a name="l00109"></a>00109 <span class="keywordflow">if</span> (! <a class="code" href="class_edge_xover.html#46d4d4724cf6d660b1a7ab4a346573d4">visited</a> [j])
|
||||
<a name="l00110"></a>00110 cand.push_back (j) ;
|
||||
<a name="l00111"></a>00111 }
|
||||
<a name="l00112"></a>00112
|
||||
<a name="l00113"></a>00113 cur_vertex = cand [rng.random (cand.size ())] ;
|
||||
<a name="l00114"></a>00114
|
||||
<a name="l00115"></a>00115 <a class="code" href="class_edge_xover.html#2d3045ef503d8b16a27e11fdc23ca11c">add_vertex</a> (cur_vertex, __child) ;
|
||||
<a name="l00116"></a>00116 }
|
||||
<a name="l00117"></a>00117 }
|
||||
<a name="l00118"></a>00118
|
||||
<a name="l00119"></a><a class="code" href="class_edge_xover.html#cb1c0a103106a4d3319540cb23163a79">00119</a> <span class="keywordtype">bool</span> <a class="code" href="class_edge_xover.html#cb1c0a103106a4d3319540cb23163a79">EdgeXover :: operator () </a>(Route & __route1, Route & __route2) {
|
||||
<a name="l00120"></a>00120
|
||||
<a name="l00121"></a>00121 <span class="comment">// Init. copy</span>
|
||||
<a name="l00122"></a>00122 Route par [2] ;
|
||||
<a name="l00123"></a>00123 par [0] = __route1 ;
|
||||
<a name="l00124"></a>00124 par [1] = __route2 ;
|
||||
<a name="l00125"></a>00125
|
||||
<a name="l00126"></a>00126 <a class="code" href="class_edge_xover.html#88c2d4c9a878454a32d56010f3dddc27">cross</a> (par [0], par [1], __route1) ;
|
||||
<a name="l00127"></a>00127 <a class="code" href="class_edge_xover.html#88c2d4c9a878454a32d56010f3dddc27">cross</a> (par [1], par [0], __route2) ;
|
||||
<a name="l00128"></a>00128
|
||||
<a name="l00129"></a>00129 __route1.invalidate () ;
|
||||
<a name="l00130"></a>00130 __route2.invalidate () ;
|
||||
<a name="l00131"></a>00131
|
||||
<a name="l00132"></a>00132 <span class="keywordflow">return</span> true ;
|
||||
<a name="l00133"></a>00133 }
|
||||
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Fri Dec 22 16:54:58 2006 for ParadisEO by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
|
||||
</body>
|
||||
</html>
|
||||
Loading…
Add table
Add a link
Reference in a new issue