node.cpp

00001 /* 
00002 * <node.cpp>
00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
00004 * (C) OPAC Team, LIFL, 2002-2007
00005 *
00006 * Sebastien Cahon, Alexandru-Adrian Tantar
00007 *
00008 * This software is governed by the CeCILL license under French law and
00009 * abiding by the rules of distribution of free software.  You can  use,
00010 * modify and/ or redistribute the software under the terms of the CeCILL
00011 * license as circulated by CEA, CNRS and INRIA at the following URL
00012 * "http://www.cecill.info".
00013 *
00014 * As a counterpart to the access to the source code and  rights to copy,
00015 * modify and redistribute granted by the license, users are provided only
00016 * with a limited warranty  and the software's author,  the holder of the
00017 * economic rights,  and the successive licensors  have only  limited liability.
00018 *
00019 * In this respect, the user's attention is drawn to the risks associated
00020 * with loading,  using,  modifying and/or developing or reproducing the
00021 * software by the user in light of its specific status of free software,
00022 * that may mean  that it is complicated to manipulate,  and  that  also
00023 * therefore means  that it is reserved for developers  and  experienced
00024 * professionals having in-depth computer knowledge. Users are therefore
00025 * encouraged to load and test the software's suitability as regards their
00026 * requirements in conditions enabling the security of their systems and/or
00027 * data to be ensured and,  more generally, to use and operate it in the
00028 * same conditions as regards security.
00029 * The fact that you are presently reading this means that you have had
00030 * knowledge of the CeCILL license and that you accept its terms.
00031 *
00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
00033 * Contact: paradiseo-help@lists.gforge.inria.fr
00034 *
00035 */
00036 
00037 #include <math.h>
00038 #include <values.h>
00039 
00040 #include "node.h"
00041 
00042 unsigned numNodes; /* Number of nodes */
00043 
00044 //static unsigned * * dist; /* Square matrix of distances */
00045 
00046 double * X_coord, * Y_coord;
00047 
00048 double X_min = MAXDOUBLE, X_max = MINDOUBLE, Y_min = MAXDOUBLE, Y_max = MINDOUBLE;
00049 
00050 void loadNodes (FILE * __f) {
00051 
00052   /* Coord */
00053   
00054   X_coord = new double [numNodes];
00055   
00056   Y_coord = new double [numNodes];
00057  
00058   unsigned num;
00059 
00060   for (unsigned i = 0; i < numNodes; i ++) {
00061     
00062     fscanf (__f, "%u%lf%lf", & num, X_coord + i, Y_coord + i);
00063     
00064     if (X_coord [i] < X_min)
00065       X_min = X_coord [i];
00066     if (X_coord [i] > X_max)
00067       X_max = X_coord [i];
00068     if (Y_coord [i] < Y_min)
00069       Y_min = Y_coord [i];
00070     if (Y_coord [i] > Y_max)
00071       Y_max = Y_coord [i];    
00072   }
00073   
00074   /* Allocation */
00075   /*
00076   dist = new unsigned * [numNodes];
00077   
00078   for (unsigned i = 0; i < numNodes; i ++)
00079     dist [i] = new unsigned [numNodes];
00080   */
00081   /* Computation of the distances */
00082   
00083   /*
00084   for (unsigned i = 0; i < numNodes; i ++) {
00085 
00086     dist [i] [i] = 0;
00087 
00088     for (unsigned j = 0; j < numNodes; j ++) {
00089       
00090       double dx = X_coord [i] - X_coord [j], dy = Y_coord [i] - Y_coord [j];
00091       
00092       dist [i] [j] = dist [j] [i] = (unsigned) (sqrt (dx * dx + dy * dy) + 0.5) ;
00093     }
00094     }*/
00095 }
00096 
00097 unsigned distance (Node __from, Node __to) {
00098 
00099   //  return dist [__from] [__to];
00100 
00101   double dx = X_coord [__from] - X_coord [__to], dy = Y_coord [__from] - Y_coord [__to];
00102   
00103   return (unsigned) (sqrt (dx * dx + dy * dy) + 0.5) ;
00104 }
00105 

Generated on Mon Oct 8 11:16:45 2007 for ParadisEO-PEOMovingObjects by  doxygen 1.4.7