| gvSIG desktop 1

/* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana

 *

 * Copyright (C) 2004 IVER T.I. and Generalitat Valenciana.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program 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 General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

package com.iver.cit.gvsig.graphtests;

import java.io.File;

import java.util.ArrayList;

import org.cresques.cts.IProjection;

import junit.framework.TestCase;

import com.hardcode.driverManager.Driver;

import com.hardcode.driverManager.DriverLoadException;

import com.hardcode.driverManager.DriverManager;

import com.hardcode.driverManager.DriverValidation;

import com.hardcode.gdbms.engine.data.DataSource;

import com.hardcode.gdbms.engine.data.DataSourceFactory;

import com.hardcode.gdbms.engine.data.NoSuchTableException;

import com.hardcode.gdbms.engine.data.driver.DBDriver;

import com.hardcode.gdbms.engine.data.driver.DriverException;

import com.hardcode.gdbms.engine.data.driver.FileDriver;

import com.hardcode.gdbms.engine.data.driver.ObjectDriver;

import com.iver.cit.gvsig.fmap.crs.CRSFactory;

import com.iver.cit.gvsig.fmap.layers.FLyrVect;

import com.iver.cit.gvsig.fmap.layers.LayerFactory;

import com.iver.cit.gvsig.fmap.layers.SelectableDataSource;

import com.iver.cit.gvsig.graph.GraphException;

import com.iver.cit.gvsig.graph.core.EdgeWeightLabeller;

import com.iver.cit.gvsig.graph.core.IGraph;

import com.iver.cit.gvsig.graph.core.NetworkLoader;

import com.iver.cit.gvsig.graph.core.NetworkRedLoader;

import com.iver.cit.gvsig.graph.solvers.Route;

import com.iver.cit.gvsig.graph.solvers.ShortestPathSolver;

import edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance;

import edu.uci.ics.jung.graph.ArchetypeVertex;

import edu.uci.ics.jung.graph.Graph;

public class TestLoader extends TestCase {

        DataSourceFactory dsf;

        FLyrVect lyr;

        public void testLoadRedNetwork() {

                NetworkRedLoader netLoader = new NetworkRedLoader();

                IGraph g = netLoader.loadNetwork();

                netLoader.loadJungNetwork();

                // Probamos la algoritmia: distancia entre nodo 1 y nodo 1000

                ShortestPathSolver solver = new ShortestPathSolver();

                solver.setLyrVect(lyr);

                solver.setGraph(g);

                // Primer punto

                solver.addFlag(443739.3, 4474704, 10);

                // Segundo punto

                solver.addFlag(443202.4, 4478132, 10);

                long t1 = System.currentTimeMillis();

                Route resul;

                try {

                        solver.setFielStreetName("Nombre");

                        resul = solver.calculateRoute();

                        long t2 = System.currentTimeMillis();

//                        assertEquals(dist.doubleValue(), 8887, 0);

                        System.out.println("dist =" + resul.getLength() + " meters. msecs: " + (t2-t1));

                } catch (GraphException e) {

                        // TODO Auto-generated catch block

                        e.printStackTrace();

                }

        }

        /*

         * Test method for 'com.iver.cit.gvsig.graph.core.NetworkLoader.loadNetwork()'

         */

        public void testLoadNetwork() {

                NetworkLoader netLoader = new NetworkLoader();

        DataSource dsNodes;

                try {

                        dsNodes = dsf.createRandomDataSource("nodes",

                                DataSourceFactory.MANUAL_OPENING);

                DataSource dsEdges = dsf.createRandomDataSource("edges",

                        DataSourceFactory.MANUAL_OPENING);

                        SelectableDataSource sdsNodes = new SelectableDataSource(dsNodes);

                        SelectableDataSource sdsEdges = new SelectableDataSource(dsEdges);

                        netLoader.setNodeReader(sdsNodes);

                        netLoader.setEdgeReader(sdsEdges);

                        Graph g = netLoader.loadJungNetwork();

                        System.out.println("Num nodos=" + g.numVertices() + " numEdges = " + g.numEdges());

                        // Probamos la algoritmia: distancia entre nodo 1 y nodo 1000

                        DijkstraDistance distCalculator = new DijkstraDistance(g, new EdgeWeightLabeller());

                        ArchetypeVertex vOrig = netLoader.indexer.getVertex(1);

                        ArchetypeVertex vEnd = netLoader.indexer.getVertex(1000);

                        long t1 = System.currentTimeMillis();

                        Number dist = distCalculator.getDistance(vOrig, vEnd);

                        long t2 = System.currentTimeMillis();

//                        assertEquals(dist.doubleValue(), 8887, 0);

                        System.out.println("dist =" + dist + " meters. msecs: " + (t2-t1));

                        System.out.println(vOrig + " - " + vEnd);

                        System.out.println(vOrig.getUserDatum("X") + ", " + vOrig.getUserDatum("Y")

                                                        + " - " + vEnd.getUserDatum("X") + ", " + vEnd.getUserDatum("Y"));

                } catch (DriverLoadException e) {

                        // TODO Auto-generated catch block

                        e.printStackTrace();

                } catch (NoSuchTableException e) {

                        // TODO Auto-generated catch block

                        e.printStackTrace();

                } catch (DriverException e) {

                        // TODO Auto-generated catch block

                        e.printStackTrace();

                }

        }

        protected void setUp() throws Exception {

                //Setup de los drivers

                DriverManager dm = new DriverManager();

                dm.setValidation(new DriverValidation() {

                                public boolean validate(Driver d) {

                                        return ((d instanceof ObjectDriver) ||

                                        (d instanceof FileDriver) ||

                                        (d instanceof DBDriver));

                                }

                        });

                dm.loadDrivers(new File("../_fwAndami/gvSIG/extensiones/com.iver.cit.gvsig/drivers"));

                LayerFactory.setDriversPath("../_fwAndami/gvSIG/extensiones/com.iver.cit.gvsig/drivers");

                //Setup del factory de DataSources

        dsf = LayerFactory.getDataSourceFactory();

                dsf.setDriverManager(dm);

                //Setup de las tablas

                dsf.addFileDataSource("gdbms dbf driver", "nodes", "c:/nodes.dbf");

                dsf.addFileDataSource("gdbms dbf driver", "edges", "c:/edges.dbf");

                IProjection prj = CRSFactory.getCRS("EPSG:23030");

                File shpFile = new File("c:/ejes.shp");

                lyr = (FLyrVect) LayerFactory.createLayer("Ejes",

                                "gvSIG shp driver", shpFile, prj);

        }

        protected void tearDown() throws Exception {

                // TODO Auto-generated method stub

                super.tearDown();

        }

}