Application: gvSIG desktop

<?xml version="1.0" encoding="UTF-8"?>

<projectDescription>

	<name>extGraph</name>

	<comment></comment>

	<projects>

	</projects>

	<buildSpec>

		<buildCommand>

			<name>org.eclipse.jdt.core.javabuilder</name>

			<arguments>

			</arguments>

		</buildCommand>

		<buildCommand>

			<name>de.loskutov.FileSync.FSBuilder</name>

			<arguments>

			</arguments>

		</buildCommand>

	</buildSpec>

	<natures>

		<nature>org.eclipse.jem.workbench.JavaEMFNature</nature>

		<nature>org.eclipse.jdt.core.javanature</nature>

		<nature>org.eclipse.jem.beaninfo.BeanInfoNature</nature>

	</natures>

</projectDescription>

package com.iver.cit.gvsig.graphtests;

import java.io.File;

import junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.exceptions.BaseException;

import org.gvsig.graph.core.GvFlag;

import org.gvsig.graph.core.IGraph;

import org.gvsig.graph.core.Network;

import org.gvsig.graph.core.loaders.NetworkRedLoader;

import org.gvsig.graph.solvers.OneToManySolver;

import org.gvsig.graph.solvers.Route;

import org.gvsig.graph.solvers.ShortestPathSolverAStar;

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

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

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

public class TestClosestFacilty extends TestCase {

	FLyrVect lyr;

	Network net;

	IGraph g;

	protected void setUp() throws Exception {

		super.setUp();

		// Setup de los drivers

		LayerFactory

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

		// Setup del factory de DataSources

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

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

		lyr = (FLyrVect) LayerFactory.createLayer("Ejes", "gvSIG shp driver",

				shpFile, prj);

		NetworkRedLoader netLoader = new NetworkRedLoader();

		netLoader.setNetFile(new File("test_files/ejes.net"));

		g = netLoader.loadNetwork();

		net = new Network();

	}

	public void testCalculate() throws BaseException {

		OneToManySolver solver = new OneToManySolver();

		net.setLayer(lyr);

		net.setGraph(g);

		solver.setNetwork(net);

		//		 Source flag

		GvFlag sourceFlag = net.createFlag(442177.19, 4476236.12, 10);

		net.addFlag(sourceFlag);

		solver.setSourceFlag(sourceFlag);

		GvFlag[] facilitiesFlags={

				net.createFlag(442211.67, 4476093.92, 10),

				net.createFlag(441703.18, 4475266.55, 10),

				net.createFlag(441022.33, 4476843.72, 10),

				net.createFlag(442612.42, 4476744.61, 10)

		};

		//		 Destination flags

		// NONE: We will use dijkstra algorithm to label network

		// and extract (after) the visited arcs.

		for (int i = 0; i < facilitiesFlags.length; i++) {

			net.addFlag(facilitiesFlags[i]);

		}

		long t1 = System.currentTimeMillis();

		solver.putDestinationsOnNetwork(net.getFlags());

		solver.setExploreAllNetwork(false);

		solver.setMaxCost(4000.0);

		solver.calculate();

		solver.removeDestinationsFromNetwork(net.getFlags());

		// En este punto tenemos la red "etiquetada" con los pesos

		// y distancias. Hay 2 opciones: recorrer toda la capa

		// y copiar los registros que nos interesan (opci?n f?cil)

		// o implementar un listener que vaya vigilando los

		// arcos que se est?n evaluando dentro del algoritmo de

		// dijkstra.

		// Primero opci?n f?cil

		// Recorremos la capa, vemos en qu? intervalo cae cada

		// entidad y escribimos un shape.

		GvFlag[] flags=net.getFlags();

		GvFlag closestFlag=null;

		if(flags.length>1){

			closestFlag=flags[1];

			for(int i=1;i<flags.length;i++){

				if(flags[i].getCost()<closestFlag.getCost()) closestFlag=flags[i];

			}

			System.out.println("Hacia el Proveedor:\nProveedor m?s cercano: "+closestFlag.getIdFlag()+" ("+closestFlag.getCost()+")");

		}

		else {

			System.out.println("Sin proveedores");

		}

		long t2 = System.currentTimeMillis();

		System.out.println("tiempo:" + (t2-t1));

		//Desde el proveedor

		try {

			this.setUp();

		} catch (Exception e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

		ShortestPathSolverAStar solverFromFacility=new ShortestPathSolverAStar();

		net.setLayer(lyr);

		net.setGraph(g);

		solverFromFacility.setNetwork(net);

		GvFlag destinyFlag = sourceFlag; //Ahora el punto de origen pasa a ser el destino

		Route bestRoute=null;

		GvFlag closestFacility=null;

		long ini=System.currentTimeMillis();

		for (int i = 0; i < facilitiesFlags.length; i++) {

			net.removeFlags();

			net.addFlag(facilitiesFlags[i]);

			net.addFlag(destinyFlag);

			Route route=solverFromFacility.calculateRoute();

			if(bestRoute==null || route.getCost()<bestRoute.getCost()){

				bestRoute=route;

				closestFacility=facilitiesFlags[i];

			}

		}

		long time=System.currentTimeMillis()-ini;

		System.out.println("Desde el proveedor: ");

		System.out.println("El mejor proveedor es: "+closestFacility.getIdFlag()+" ("+bestRoute.getCost()+")");

		System.out.println("Coste: "+time);

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

	}

}

/* 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 junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.exceptions.BaseException;

import org.gvsig.graph.core.GvFlag;

import org.gvsig.graph.core.IGraph;

import org.gvsig.graph.core.Network;

import org.gvsig.graph.core.loaders.NetworkRedLoader;

import org.gvsig.graph.solvers.CompactAreaExtractor;

import org.gvsig.graph.solvers.CompactAreaExtractorVisAD;

import org.gvsig.graph.solvers.OneToManySolver;

import org.gvsig.graph.solvers.ServiceAreaExtractor2;

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

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

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

/**

 * @author fjp

 *

 * A partir de un iterador de Features (de l?neas), implementamos probamos que

 * podemos generar un pol?gono (si puede ser, convexo) que las

 * englobe todas. 

 */

public class TestServiceAreaPolygonVisAD extends TestCase {

	FLyrVect lyr;

	Network net;

	IGraph g;

	protected void setUp() throws Exception {

		super.setUp();

		// Setup de los drivers

		LayerFactory

				.setDriversPath("../_fwAndami/gvSIG/extensiones/org.gvsig/drivers");

		// Setup del factory de DataSources

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

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

		lyr = (FLyrVect) LayerFactory.createLayer("Ejes", "gvSIG shp driver",

				shpFile, prj);

		NetworkRedLoader netLoader = new NetworkRedLoader();

		netLoader.setNetFile(new File("test_files/ejes.net"));

		g = netLoader.loadNetwork();

		net = new Network();

	}

	public void testCalculate() throws BaseException {

		OneToManySolver solver = new OneToManySolver();

		net.setLayer(lyr);

		net.setGraph(g);

		solver.setNetwork(net);

		ServiceAreaExtractor2 extractor = new ServiceAreaExtractor2(net);

		solver.addListener(extractor);

		extractor.setDoCompactArea(true);

		CompactAreaExtractorVisAD compact = new CompactAreaExtractorVisAD(net);

		// solver.addListener(compact);

		//		 Source flag

		GvFlag sourceFlag = net.createFlag(441905.80, 4475975.2, 10);

		extractor.setIdFlag(0);

		net.addFlag(sourceFlag);

		solver.setSourceFlag(sourceFlag);

		double[] costs = {1000.0};

		extractor.setCosts(costs);

		//		 Destination flags

		// NONE: We will use dijkstra algorithm to label network

		// and extract (after) the visited arcs.

//		net.addFlag(441901, 4475977, 10);

//		net.addFlag(442830, 4476201, 200);

//		net.addFlag(442673, 4475125, 200);

		long t1 = System.currentTimeMillis();

		solver.putDestinationsOnNetwork(net.getFlags());

		solver.setExploreAllNetwork(true);

		solver.setMaxDistance(1000.0);

		solver.calculate();

		extractor.writeServiceArea();

		extractor.getBorderPoints();

		extractor.closeFiles();

		solver.removeDestinationsFromNetwork(net.getFlags());

//		compact.writeServiceArea();

//		compact.closeFiles();

		long t2 = System.currentTimeMillis();

		System.out.println("tiempo:" + (t2-t1));

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

	}

}

/* 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 junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.exceptions.BaseException;

import org.gvsig.graph.core.GvFlag;

import org.gvsig.graph.core.IGraph;

import org.gvsig.graph.core.Network;

import org.gvsig.graph.core.loaders.NetworkRedLoader;

import org.gvsig.graph.solvers.OneToManySolver;

import org.gvsig.graph.solvers.ServiceAreaExtractor;

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

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

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

public class TestServiceArea extends TestCase {

	FLyrVect lyr;

	Network net;

	IGraph g;

	protected void setUp() throws Exception {

		super.setUp();

		// Setup de los drivers

		LayerFactory

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

		// Setup del factory de DataSources

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

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

		lyr = (FLyrVect) LayerFactory.createLayer("Ejes", "gvSIG shp driver",

				shpFile, prj);

		NetworkRedLoader netLoader = new NetworkRedLoader();

		netLoader.setNetFile(new File("test_files/ejes.net"));

		g = netLoader.loadNetwork();

		net = new Network();

	}

	public void testCalculate() throws BaseException {

		OneToManySolver solver = new OneToManySolver();

		net.setLayer(lyr);

		net.setGraph(g);

		solver.setNetwork(net);

		ServiceAreaExtractor extractor = new ServiceAreaExtractor(net);

		//		 Source flag

		GvFlag sourceFlag = net.createFlag(441901, 4475977, 10);

		net.addFlag(sourceFlag);

		solver.setSourceFlag(sourceFlag);

		//		 Destination flags

		// NONE: We will use dijkstra algorithm to label network

		// and extract (after) the visited arcs.

//		net.addFlag(441901, 4475977, 10);

//		net.addFlag(442830, 4476201, 200);

//		net.addFlag(442673, 4475125, 200);

		long t1 = System.currentTimeMillis();

		solver.putDestinationsOnNetwork(net.getFlags());

		solver.setExploreAllNetwork(true);

		solver.setMaxDistance(4000.0);

		solver.calculate();

		solver.removeDestinationsFromNetwork(net.getFlags());

		// En este punto tenemos la red "etiquetada" con los pesos

		// y distancias. Hay 2 opciones: recorrer toda la capa

		// y copiar los registros que nos interesan (opci?n f?cil)

		// o implementar un listener que vaya vigilando los

		// arcos que se est?n evaluando dentro del algoritmo de

		// dijkstra.

		// Primero opci?n f?cil

		// Recorremos la capa, vemos en qu? intervalo cae cada

		// entidad y escribimos un shape.

		double[] costs = {1000.0, 2000.0, 4000.0};

		extractor.doExtract(0, costs); // 2000 en unidades de coste. Normalmente ser?n segundos

		// TODO: Tambi?n puede ser interesante fijar un l?mite en distancia, no

		// en tiempo

		long t2 = System.currentTimeMillis();

		System.out.println("tiempo:" + (t2-t1));

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

	}

}

package com.iver.cit.gvsig.graphtests;

import java.io.File;

import junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.exceptions.BaseException;

import org.gvsig.graph.core.writers.NetworkGvTableWriter;

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

import com.iver.cit.gvsig.fmap.edition.writers.dbf.DbfWriter;

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

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

public class TestNetworkGvTableWriter extends TestCase {

	NetworkGvTableWriter netBuilder = new NetworkGvTableWriter();

	FLyrVect lyr;

	/*

	 * Test method for

	 * 'org.gvsig.graph.core.NetworkWriter.writeNetwork()'

	 */

	public void testWriteNetwork() {

		try {

			long t1 = System.currentTimeMillis();

			netBuilder.writeNetwork();

			long t2 = System.currentTimeMillis();

			System.out.println("Building DBF time:" + (t2-t1) + " msecs.");

		} catch (BaseException e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

	}

	protected void setUp() throws Exception {

		LayerFactory

				.setDriversPath("../_fwAndami/gvSIG/extensiones/org.gvsig/drivers");

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

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

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

				"gvSIG shp driver", shpFile, prj);

		String fieldType = "tipored";

		String fieldDist = "length";

		String fieldCost = "cost";

		String fieldSense = "";

		netBuilder.setLayer(lyr);

		netBuilder.setFieldCost(fieldCost);

		netBuilder.setFieldType(fieldType);

		netBuilder.setFieldDist(fieldDist);

		netBuilder.setFieldSense(fieldSense);

		DbfWriter nodeWriter = new DbfWriter();

		File nodeFile = new File("c:/nodes.dbf");

		nodeFile.delete();

		nodeWriter.setFile(nodeFile);

		File edgeFile = new File("c:/edges.dbf");

		DbfWriter edgeWriter = new DbfWriter();

		edgeWriter.setFile(edgeFile);

		netBuilder.setEdgeWriter(edgeWriter);

		netBuilder.setNodeWriter(nodeWriter);

	}

}

package com.iver.cit.gvsig.graphtests;

import junit.framework.Test;

import junit.framework.TestSuite;

public class AllTests {

	public static Test suite() {

		TestSuite suite = new TestSuite(

				"Test for org.gvsig.graph.test");

		//$JUnit-BEGIN$

		suite.addTestSuite(TestJGraphT_BAD_SHORTEST_PATH.class);

		suite.addTestSuite(TestAngle.class);

		//$JUnit-END$

		return suite;

	}

}

package com.iver.cit.gvsig.graphtests;

import java.io.File;

import java.sql.Connection;

import java.sql.DriverManager;

import junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.exceptions.BaseException;

import org.gvsig.graph.core.writers.NetworkJdbcWriter;

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

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

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

public class TestNetworJdbcWriter extends TestCase {

	NetworkJdbcWriter netBuilder = new NetworkJdbcWriter();

	FLyrVect lyr;

	/*

	 * Test method for

	 * 'org.gvsig.graph.core.NetworkWriter.writeNetwork()'

	 */

	public void testWriteNetwork() {

		try {

			long t1 = System.currentTimeMillis();

			netBuilder.writeNetwork();

			long t2 = System.currentTimeMillis();

			System.out.println("Building MYSQL time:" + (t2-t1) + " msecs.");

		} catch (BaseException e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

	}

	protected void setUp() throws Exception {

		LayerFactory

				.setDriversPath("../_fwAndami/gvSIG/extensiones/org.gvsig/drivers");

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

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

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

				"gvSIG shp driver", shpFile, prj);

		String fieldType = "tipored";

		String fieldDist = "length";

		String fieldCost = "cost";

		String fieldSense = "";

		netBuilder.setLayer(lyr);

		netBuilder.setFieldCost(fieldCost);

		netBuilder.setFieldType(fieldType);

		netBuilder.setFieldDist(fieldDist);

		netBuilder.setFieldSense(fieldSense);

        String dbURL = "jdbc:mysql://localhost:3306/test";  

        String user = "root";

        String pwd = "aquilina";

        Connection conn;

		conn = DriverManager.getConnection(dbURL, user, pwd);

		netBuilder.setConnection(conn);

	}

}

package com.iver.cit.gvsig.graphtests;

import java.io.File;

import junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.exceptions.BaseException;

import org.gvsig.graph.core.EdgeWeightLabeller;

import org.gvsig.graph.core.FNode;

import org.gvsig.graph.core.GraphException;

import org.gvsig.graph.core.IGraph;

import org.gvsig.graph.core.JungGraph;

import org.gvsig.graph.core.Network;

import org.gvsig.graph.core.loaders.NetworkLoader;

import org.gvsig.graph.core.loaders.NetworkRedLoader;

import org.gvsig.graph.solvers.Route;

import org.gvsig.graph.solvers.ShortestPathSolverAStar;

import org.gvsig.graph.solvers.ShortestPathSolverDijkstra;

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

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

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 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_and_ShortestPath extends TestCase {

	DataSourceFactory dsf;

	FLyrVect lyr;

	public void testLoadRedNetwork() {

		NetworkRedLoader netLoader = new NetworkRedLoader();

		netLoader.setNetFile(new File("test_files/ejes.net"));

		IGraph g = netLoader.loadNetwork();

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

		Network net = new Network();

		ShortestPathSolverDijkstra solver = new ShortestPathSolverDijkstra();

		net.setLayer(lyr);

		net.setGraph(g);

		solver.setNetwork(net);

		ShortestPathSolverAStar solverAstar = new ShortestPathSolverAStar();

		solverAstar.setNetwork(net);

		try {

			// Primer punto

			net.addFlag(433647.09370, 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));

			t1 = System.currentTimeMillis();

			Route resul2;

			solverAstar.setFielStreetName("Nombre");

			resul2 = solverAstar.calculateRoute();

			t2 = System.currentTimeMillis();

			System.out.println("ASTAR dist =" + resul2.getLength()

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

			assertEquals(resul.getLength(), resul2.getLength(), 0.0);

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

			assertEquals(resul.getLength(), dist.doubleValue(), 0.4);

//			net.addTurnCost(idArcOrigin, idArcDestination, newCost);

		} catch (GraphException e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

	}

	/*

	 * Test method for

	 * 'org.gvsig.graph.core.NetworkLoader.loadNetwork()'

	 */

	public void DONT_TEST_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 (BaseException 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("test_files/ejes.shp");

		lyr = (FLyrVect) LayerFactory.createLayer("Ejes", "gvSIG shp driver",

				shpFile, prj);

	}

	protected void tearDown() throws Exception {

		// TODO Auto-generated method stub

		super.tearDown();

	}

}

/* 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 junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.exceptions.BaseException;

import org.gvsig.graph.core.GvFlag;

import org.gvsig.graph.core.IGraph;

import org.gvsig.graph.core.Network;

import org.gvsig.graph.core.loaders.NetworkRedLoader;

import org.gvsig.graph.solvers.CompactAreaExtractor;

import org.gvsig.graph.solvers.OneToManySolver;

import org.gvsig.graph.solvers.ServiceAreaExtractor2;

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

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

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

/**

 * @author fjp

 *

 * A partir de un iterador de Features (de l?neas), implementamos probamos que

 * podemos generar un pol?gono (si puede ser, convexo) que las

 * englobe todas. 

 */

public class TestServiceAreaPolygon extends TestCase {

	FLyrVect lyr;

	Network net;

	IGraph g;

	protected void setUp() throws Exception {

		super.setUp();

		// Setup de los drivers

		LayerFactory

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

		// Setup del factory de DataSources

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

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

		lyr = (FLyrVect) LayerFactory.createLayer("Ejes", "gvSIG shp driver",

				shpFile, prj);

		NetworkRedLoader netLoader = new NetworkRedLoader();

		netLoader.setNetFile(new File("test_files/ejes.net"));

		g = netLoader.loadNetwork();

		net = new Network();

	}

	public void testCalculate() throws BaseException {

		OneToManySolver solver = new OneToManySolver();

		net.setLayer(lyr);

		net.setGraph(g);

		solver.setNetwork(net);

		ServiceAreaExtractor2 extractor = new ServiceAreaExtractor2(net);

		solver.addListener(extractor);

		CompactAreaExtractor compact = new CompactAreaExtractor(net);

		solver.addListener(compact);

		//		 Source flag

		GvFlag sourceFlag = net.createFlag(441901, 4475977, 10);

		extractor.setIdFlag(0);

		net.addFlag(sourceFlag);

		solver.setSourceFlag(sourceFlag);

		//		 Destination flags

		// NONE: We will use dijkstra algorithm to label network

		// and extract (after) the visited arcs.

//		net.addFlag(441901, 4475977, 10);

//		net.addFlag(442830, 4476201, 200);

//		net.addFlag(442673, 4475125, 200);

		long t1 = System.currentTimeMillis();

		solver.putDestinationsOnNetwork(net.getFlags());

		solver.setExploreAllNetwork(true);

		solver.setMaxDistance(1000.0);

		double[] costs = {500.0, 1000.0};

		extractor.setCosts(costs);

		solver.calculate();

		extractor.writeServiceArea();

		extractor.closeFiles();

		solver.removeDestinationsFromNetwork(net.getFlags());

		compact.writeServiceArea();

		compact.closeFiles();

		long t2 = System.currentTimeMillis();

		System.out.println("tiempo:" + (t2-t1));

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

	}

}

package com.iver.cit.gvsig.graphtests;

import java.io.File;

import junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.graph.core.GraphException;

import org.gvsig.graph.core.GvFlag;

import org.gvsig.graph.core.IGraph;

import org.gvsig.graph.core.Network;

import org.gvsig.graph.core.loaders.NetworkRedLoader;

import org.gvsig.graph.solvers.ReverseOneToManySolver;

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

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

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

public class TestReverseOneToMany extends TestCase {

	FLyrVect lyr;

	Network net;

	IGraph g;

	protected void setUp() throws Exception {

		super.setUp();

		// Setup de los drivers

		LayerFactory

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

		// Setup del factory de DataSources

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

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

		lyr = (FLyrVect) LayerFactory.createLayer("Ejes", "gvSIG shp driver",

				shpFile, prj);

		NetworkRedLoader netLoader = new NetworkRedLoader();

		netLoader.setNetFile(new File("test_files/ejes.net"));

		g = netLoader.loadNetwork();

		net = new Network();

	}

	public void testCalculate() throws GraphException {

		ReverseOneToManySolver solver = new ReverseOneToManySolver();

		net.setLayer(lyr);

		net.setGraph(g);

		solver.setNetwork(net);

		//		 Source flag

		GvFlag sourceFlag = net.createFlag(441901, 4475977, 10);

		solver.setSourceFlag(sourceFlag);

		//		 Destination flags

		net.addFlag(441901, 4475977, 10);

		net.addFlag(442830, 4476201, 200);

		net.addFlag(442673, 4475125, 200);

		long t1 = System.currentTimeMillis();

		solver.putDestinationsOnNetwork(net.getFlags());

		solver.calculate();

		solver.removeDestinationsFromNetwork(net.getFlags());

		long t2 = System.currentTimeMillis();

		System.out.println("tiempo:" + (t2-t1));

		GvFlag flags[] = net.getFlags();

		for (int i=0; i < flags.length; i++)

		{

			System.out.println("Flag " + i + " " + flags[i].getCost());

		}

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

	}

}

package com.iver.cit.gvsig.graphtests;

import java.util.ArrayList;

import java.util.Collection;

import java.util.HashSet;

import java.util.Random;

import junit.framework.TestCase;

/**

 * @author Francisco Jos? Pe?arrubia (fjp@scolab.es)

 *

 * Working with arrays is 4 times faster (inserting) than hashsets, and consumes twice less memory

 */

public class TestArrayVsHashSet extends TestCase {

	private void runGC () throws Exception

    {

        // It helps to call Runtime.gc()

        // using several method calls:

        for (int r = 0; r < 4; ++ r) _runGC ();

    }

    private void _runGC () throws Exception

    {

        long usedMem1 = usedMemory (), usedMem2 = Long.MAX_VALUE;

        for (int i = 0; (usedMem1 < usedMem2) && (i < 500); ++ i)

        {

            s_runtime.runFinalization ();

            s_runtime.gc ();

            Thread.currentThread ().yield ();

            usedMem2 = usedMem1;

            usedMem1 = usedMemory ();

        }

    }

    private long usedMemory ()

    {

        return s_runtime.totalMemory () - s_runtime.freeMemory ();

    }

    private static final Runtime s_runtime = Runtime.getRuntime ();

    private void test(Collection lst) {

    	long t1 = System.currentTimeMillis();

		Random rnd = new Random();

		long mem1 = usedMemory();

		for (int i = 0; i < 1000000; i++) {

			Integer aux = rnd.nextInt();

			lst.add(aux);

		}

		long mem2 = usedMemory();

		long t2 = System.currentTimeMillis();

		System.out.println("load " + lst.getClass().getCanonicalName() + " msecs: " + (t2 - t1) + " memUsed:"

				+ ((mem2 - mem1) / 1024) + "K");

    }

    public void testArray() {

		try {

			runGC();

			ArrayList array = new ArrayList();

			test(array);

		} catch (Exception e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

	}

	public void testHashSet() {

		try {

			runGC();

			HashSet<Integer> set = new HashSet<Integer>();

			test(set);

		} catch (Exception e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

	}

	protected void setUp() throws Exception {

	}

}

package com.iver.cit.gvsig.graphtests;

import java.io.File;

import junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.graph.core.GraphException;

import org.gvsig.graph.core.GvFlag;

import org.gvsig.graph.core.IGraph;

import org.gvsig.graph.core.Network;

import org.gvsig.graph.core.loaders.NetworkRedLoader;

import org.gvsig.graph.solvers.OneToManySolver;

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

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

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

public class TestOneToMany extends TestCase {

	FLyrVect lyr;

	Network net;

	IGraph g;

	protected void setUp() throws Exception {

		super.setUp();

		// Setup de los drivers

		LayerFactory

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

		// Setup del factory de DataSources

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

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

		lyr = (FLyrVect) LayerFactory.createLayer("Ejes", "gvSIG shp driver",

				shpFile, prj);

		NetworkRedLoader netLoader = new NetworkRedLoader();

		netLoader.setNetFile(new File("test_files/ejes.net"));

		g = netLoader.loadNetwork();

		net = new Network();

	}

	public void testCalculate() throws GraphException {

		OneToManySolver solver = new OneToManySolver();

		net.setLayer(lyr);

		net.setGraph(g);

		solver.setNetwork(net);

		//		 Source flag

		GvFlag sourceFlag = net.createFlag(441901, 4475977, 10);

		solver.setSourceFlag(sourceFlag);

		//		 Destination flags

		net.addFlag(441901, 4475977, 10);

		net.addFlag(442830, 4476201, 200);

		net.addFlag(442673, 4475125, 200);

		long t1 = System.currentTimeMillis();

		solver.putDestinationsOnNetwork(net.getFlags());

		solver.calculate();

		solver.removeDestinationsFromNetwork(net.getFlags());

		long t2 = System.currentTimeMillis();

		System.out.println("tiempo:" + (t2-t1));

		GvFlag flags[] = net.getFlags();

		for (int i=0; i < flags.length; i++)

		{

			System.out.println("Flag " + i + " " + flags[i].getCost());

		}

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

	}

}

/* gvSIG. Geographic Information System of the Valencian Government

*

* Copyright (C) 2007-2008 Infrastructures and Transports Department

* of the Valencian Government (CIT)

* 

* 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., 51 Franklin Street, Fifth Floor, Boston, 

* MA  02110-1301, USA.

* 

*/

/*

* AUTHORS (In addition to CIT):

* 2008 {{Company}}   {{Task}}

*/

package com.iver.cit.gvsig.graphtests;

import java.io.File;

import java.util.Collection;

import junit.framework.TestCase;

import org.cresques.cts.IProjection;

import org.gvsig.exceptions.BaseException;

import org.gvsig.fmap.algorithm.contouring.LoopRemover;

import com.iver.cit.gvsig.fmap.core.IFeature;

import com.iver.cit.gvsig.fmap.core.IGeometry;

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

import com.vividsolutions.jts.geom.Geometry;

import com.vividsolutions.jts.geom.Polygon;

import com.vividsolutions.jts.operation.linemerge.LineSequencer;

import com.vividsolutions.jts.operation.polygonize.Polygonizer;

public class TestCreatePolygon extends TestCase {

	FLyrVect lyr;

	protected void setUp() throws Exception {

		super.setUp();

		// Setup de los drivers

		LayerFactory

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

		// Setup del factory de DataSources

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

		File shpFile = new File("test_files/contour3.shp");

		lyr = (FLyrVect) LayerFactory.createLayer("Contour", "gvSIG shp driver",

				shpFile, prj);

	}

	public void testCalculatePolygon() throws BaseException {

		ReadableVectorial rv = lyr.getSource();

		long t1 = System.currentTimeMillis();

		LoopRemover sequencer = new LoopRemover();

		Polygonizer pol = new Polygonizer();

		rv.start();

		for (int i=0; i < rv.getShapeCount(); i++) {

			IFeature feat = rv.getFeature(i);

			IGeometry geom = feat.getGeometry();

			Geometry jtsGeom = geom.toJTSGeometry();

			sequencer.add(jtsGeom);

			pol.add(jtsGeom);

//			if (jtsGeom instanceof LineString)

//			{

//				LineString lineString = (LineString) jtsGeom;

//				graph.addEdge(lineString);

//			}

		}

		rv.stop();

//		Iterator it = graph.edgeIterator();

//		while (it.hasNext()) {

//			Edge edge = (Edge) it.next();

//			edge.

//		}

		Collection<Polygon> polygons = pol.getPolygons();

		for (Polygon p : polygons) {

			System.out.println(p.toText());

		}

		Geometry newJtsGeom = sequencer.getSequencedLineStrings();

		System.out.println(newJtsGeom.toText());

		long t2 = System.currentTimeMillis();

		System.out.println("tiempo:" + (t2-t1));

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

	}

//	public void testCalculateContour() throws BaseException {

//

//		ReadableVectorial rv = lyr.getSource();

//		

//		long t1 = System.currentTimeMillis();

////		WatsonTriangulator triangulator = new WatsonTriangulator();

////		ChewTriangulator triangulator = new ChewTriangulator();

//		FJenettTriangulator triangulator = new FJenettTriangulator();

//		rv.start();

//		for (int i=0; i < rv.getShapeCount(); i++) {

//			IFeature feat = rv.getFeature(i);

//			IGeometry geom = feat.getGeometry();

//			Object shp = geom.getInternalShape();

//			if (shp instanceof FPoint2D)

//			{

//				FPoint2D p = (FPoint2D) geom.getInternalShape();

//				// 	Leer la Z para hacer el contour. Para la trianqulaci?n no hace falta.

//				triangulator.addVertex(new Vertex(p.getX(), p.getY()));

//			}

//			if (shp instanceof FMultiPoint2D)

//			{

//				FMultiPoint2D multi = (FMultiPoint2D) shp;

//				for (int j=0; j < multi.getNumPoints(); j++) {

//					FPoint2D p = multi.getPoint(j);

//					NumericValue val = (NumericValue) feat.getAttribute(0);

//					triangulator.addVertex(new Vertex(p.getX(), p.getY(), val.doubleValue()));

//				}

//			}

//			

//		}

//		rv.stop();

//		

//		TIN tin = triangulator.calculateTriangulation();

//		ContourCalculator contourCalculator = new ContourCalculator(tin);

//		Collection<LineString> contour = contourCalculator.getContour(4.7);

//		System.out.println("Contour = " + contour.toString());

//		

//		Collection<LineString> contour2 = contourCalculator.getContour_Complex_BAD(4.7);

//		System.out.println("Contour2 = " + contour2.toString());

//		

//		List <Triangle> triangles = triangulator.getTriangles();

//