| 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.sql.Driver;

import java.sql.DriverManager;

import java.util.List;

import junit.framework.TestCase;

import org.cresques.cts.IProjection;

import com.hardcode.driverManager.DriverLoadException;

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.FNode;

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

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

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

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.algorithms.shortestpath.DijkstraShortestPath;

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();

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

                Network net = new Network();

                ShortestPathSolver solver = new ShortestPathSolver();

                net.setLayer(lyr);

                net.setGraph(g);

                solver.setNetwork(net);

                try {

                        // Primer punto

                        net.addFlag(433647.09375, 4488029, 10);

                        // Segundo punto

                        net.addFlag(437290.96875, 4481547, 10);

                        long t1 = System.currentTimeMillis();

                        Route resul;

                        solver.setFielStreetName("Nombre");

                        resul = solver.calculateRoute();

                        long t2 = System.currentTimeMillis();

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

                        System.out.println("fjp dist =" + resul.getLength()

                                        + " meters. msecs: " + (t2 - t1));

                        JungGraph jG = new JungGraph(g);

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

                        DijkstraShortestPath distCalculator = new DijkstraShortestPath(jG,

                                        new EdgeWeightLabeller());

                        FNode vOrig = jG.getVertexByID(1);

                        FNode vEnd = jG.getVertexByID(1000);

                        t1 = System.currentTimeMillis();

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

                        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.getX() + ", " + vOrig.getY() + " - "

                                        + vEnd.getX() + ", " + vEnd.getY());

                } catch (GraphException e) {

                        // TODO Auto-generated catch block

                        e.printStackTrace();

                }

        }

        /*

         * Test method for

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

         */

        public void testLoadNetwork() {

                // if (true) return;

                NetworkLoader netLoader = new NetworkLoader(true);

                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.getIndexer().getVertex(1);

                        ArchetypeVertex vEnd = netLoader.getIndexer().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

                LayerFactory

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

                // Setup del factory de DataSources

                dsf = LayerFactory.getDataSourceFactory();

                // 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();

        }

}