850b834510
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@127 331e1502-861f-0410-8da2-ba01fb791d7f
121 lines
8.2 KiB
HTML
Executable file
121 lines
8.2 KiB
HTML
Executable file
<!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: node.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>node.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">// "node.cpp"</span>
|
|
<a name="l00004"></a>00004
|
|
<a name="l00005"></a>00005 <span class="comment">// (c) OPAC Team, LIFL, January 2006</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 <math.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 "node.h"</span>
|
|
<a name="l00028"></a>00028
|
|
<a name="l00029"></a>00029 <span class="keywordtype">unsigned</span> numNodes; <span class="comment">/* Number of nodes */</span>
|
|
<a name="l00030"></a>00030
|
|
<a name="l00031"></a>00031 <span class="comment">//static unsigned * * dist; /* Square matrix of distances */</span>
|
|
<a name="l00032"></a>00032
|
|
<a name="l00033"></a>00033 <span class="keywordtype">double</span> * X_coord, * Y_coord;
|
|
<a name="l00034"></a>00034
|
|
<a name="l00035"></a>00035 <span class="keywordtype">double</span> X_min = MAXDOUBLE, X_max = MINDOUBLE, Y_min = MAXDOUBLE, Y_max = MINDOUBLE;
|
|
<a name="l00036"></a>00036
|
|
<a name="l00037"></a>00037 <span class="keywordtype">void</span> loadNodes (FILE * __f) {
|
|
<a name="l00038"></a>00038
|
|
<a name="l00039"></a>00039 <span class="comment">/* Coord */</span>
|
|
<a name="l00040"></a>00040
|
|
<a name="l00041"></a>00041 X_coord = <span class="keyword">new</span> <span class="keywordtype">double</span> [numNodes];
|
|
<a name="l00042"></a>00042
|
|
<a name="l00043"></a>00043 Y_coord = <span class="keyword">new</span> <span class="keywordtype">double</span> [numNodes];
|
|
<a name="l00044"></a>00044
|
|
<a name="l00045"></a>00045 <span class="keywordtype">unsigned</span> num;
|
|
<a name="l00046"></a>00046
|
|
<a name="l00047"></a>00047 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < numNodes; i ++) {
|
|
<a name="l00048"></a>00048
|
|
<a name="l00049"></a>00049 fscanf (__f, <span class="stringliteral">"%u%lf%lf"</span>, & num, X_coord + i, Y_coord + i);
|
|
<a name="l00050"></a>00050
|
|
<a name="l00051"></a>00051 <span class="keywordflow">if</span> (X_coord [i] < X_min)
|
|
<a name="l00052"></a>00052 X_min = X_coord [i];
|
|
<a name="l00053"></a>00053 <span class="keywordflow">if</span> (X_coord [i] > X_max)
|
|
<a name="l00054"></a>00054 X_max = X_coord [i];
|
|
<a name="l00055"></a>00055 <span class="keywordflow">if</span> (Y_coord [i] < Y_min)
|
|
<a name="l00056"></a>00056 Y_min = Y_coord [i];
|
|
<a name="l00057"></a>00057 <span class="keywordflow">if</span> (Y_coord [i] > Y_max)
|
|
<a name="l00058"></a>00058 Y_max = Y_coord [i];
|
|
<a name="l00059"></a>00059 }
|
|
<a name="l00060"></a>00060
|
|
<a name="l00061"></a>00061 <span class="comment">/* Allocation */</span>
|
|
<a name="l00062"></a>00062 <span class="comment">/*</span>
|
|
<a name="l00063"></a>00063 <span class="comment"> dist = new unsigned * [numNodes];</span>
|
|
<a name="l00064"></a>00064 <span class="comment"> </span>
|
|
<a name="l00065"></a>00065 <span class="comment"> for (unsigned i = 0; i < numNodes; i ++)</span>
|
|
<a name="l00066"></a>00066 <span class="comment"> dist [i] = new unsigned [numNodes];</span>
|
|
<a name="l00067"></a>00067 <span class="comment"> */</span>
|
|
<a name="l00068"></a>00068 <span class="comment">/* Computation of the distances */</span>
|
|
<a name="l00069"></a>00069
|
|
<a name="l00070"></a>00070 <span class="comment">/*</span>
|
|
<a name="l00071"></a>00071 <span class="comment"> for (unsigned i = 0; i < numNodes; i ++) {</span>
|
|
<a name="l00072"></a>00072 <span class="comment"></span>
|
|
<a name="l00073"></a>00073 <span class="comment"> dist [i] [i] = 0;</span>
|
|
<a name="l00074"></a>00074 <span class="comment"></span>
|
|
<a name="l00075"></a>00075 <span class="comment"> for (unsigned j = 0; j < numNodes; j ++) {</span>
|
|
<a name="l00076"></a>00076 <span class="comment"> </span>
|
|
<a name="l00077"></a>00077 <span class="comment"> double dx = X_coord [i] - X_coord [j], dy = Y_coord [i] - Y_coord [j];</span>
|
|
<a name="l00078"></a>00078 <span class="comment"> </span>
|
|
<a name="l00079"></a>00079 <span class="comment"> dist [i] [j] = dist [j] [i] = (unsigned) (sqrt (dx * dx + dy * dy) + 0.5) ;</span>
|
|
<a name="l00080"></a>00080 <span class="comment"> }</span>
|
|
<a name="l00081"></a>00081 <span class="comment"> }*/</span>
|
|
<a name="l00082"></a>00082 }
|
|
<a name="l00083"></a>00083
|
|
<a name="l00084"></a>00084 <span class="keywordtype">unsigned</span> distance (<a class="code" href="struct_node.html">Node</a> __from, <a class="code" href="struct_node.html">Node</a> __to) {
|
|
<a name="l00085"></a>00085
|
|
<a name="l00086"></a>00086 <span class="comment">// return dist [__from] [__to];</span>
|
|
<a name="l00087"></a>00087
|
|
<a name="l00088"></a>00088 <span class="keywordtype">double</span> dx = X_coord [__from] - X_coord [__to], dy = Y_coord [__from] - Y_coord [__to];
|
|
<a name="l00089"></a>00089
|
|
<a name="l00090"></a>00090 <span class="keywordflow">return</span> (<span class="keywordtype">unsigned</span>) (sqrt (dx * dx + dy * dy) + 0.5) ;
|
|
<a name="l00091"></a>00091 }
|
|
<a name="l00092"></a>00092
|
|
</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>
|