| gvSIG desktop 1

	protected ArrayList flags = new ArrayList();

	 * TODO: Por ahora, cogemos el nodo m?s cercano. Lo correcto

	 * es a?adir un nuevo nodo que divida el arco, y devolver el 

	 * id de ese nodo.

		GvEdge edge = graph.getEdgeByID(flag.getIdArc());

		GvNode from = graph.getNodeByID(edge.getIdNodeOrig());

		GvNode to = graph.getNodeByID(edge.getIdNodeEnd());

		if (flag.getPct() > 0.5)

			return to.getIdNode();

		else

			return from.getIdNode();

	/**

	 * @param idArc

	 * @param x

	 * @param y

	 * @return entre 0.0 y 1.0

	 */

		flag.setPct(percentAlong(idArc, x, y));

		flag.setPct(percentAlong(idArc, x, y));

		flags.add(flag);

	public void setGraph(IGraph g) {

		this.graph  = g;		

	}

			return g;

		// TODO: POR AHORA, WEIGHT = LENGTH. Con setVelocities() lo cambiamos.		

		edge.setWeight(edge.getDistance());

	int from_link = -1; // id del Arco desde el que hemos llegado

	public int getFromLink() {

	public void setFromLink(int from_link) {

import java.util.ArrayList;

		ArrayList nodes = new ArrayList();

					nodes.add(nodeAux);

					nodes.add(nodeAux);

			for (int j=0; j < nodes.size(); j++) {

				NodeGv node = (NodeGv) nodes.get(j);

			output.writeInt(nodes.size());

	public void setGraph(IGraph g);

	public IGraph getGraph();

/* 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.graph.solvers;

import java.util.ArrayList;

import com.hardcode.gdbms.engine.values.DoubleValue;

import com.hardcode.gdbms.engine.values.Value;

import com.hardcode.gdbms.engine.values.ValueFactory;

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

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

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

/**

 * @author fjp

 * featureList es un array de IFeature.

 * Los campos que tiene cada feature son:

 * 0-> Id_Tramo (idArc sobre el que est? ese tramo de ruta.

 * 1-> Weight

 * 2-> Length

 * 3-> Texto calle o via por la que pasa.

 *

 */

public class Route {

	public IFeature addRouteFeature(IGeometry geom, int idArc, double weight, double length, String text)

	{

		Value[] values = new Value[4];

		values[0] = ValueFactory.createValue(idArc);

		values[1] = ValueFactory.createValue(weight);

		values[2] = ValueFactory.createValue(length);

		values[3] = ValueFactory.createValue(text);

		System.out.println("A?ado text= " + text);

		DefaultFeature feat = new DefaultFeature(geom, values, featureList.size() + "");

		featureList.add(feat);

		return feat;

	}

	private ArrayList featureList = new ArrayList();

	private ArrayList getFeatureList() 

	{

		return featureList;

	}

	public String getInstructions() {

		return null;

	}

	public double getLength() {

		double  distTotal = 0;

		for (int i=0; i < featureList.size(); i++)

		{

			IFeature feat = (IFeature) featureList.get(i);

			DoubleValue length = (DoubleValue) feat.getAttribute(2);

			double dist = length.doubleValue();

			distTotal += dist;

		}

		return distTotal;

	}

	public double getCost() {

		double  costTotal = 0;

		for (int i=0; i < featureList.size(); i++)

		{

			IFeature feat = (IFeature) featureList.get(i);

			DoubleValue costVal = (DoubleValue) feat.getAttribute(1);

			double cost = costVal.doubleValue();

			costTotal += cost;

		}

		return costTotal;		

	}

}

import java.util.Vector;

import com.iver.cit.gvsig.fmap.DriverException;

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

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

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

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

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

	protected Route route = new Route();

	private int fieldIndexStreetName;

	public void setFielStreetName(String name) {

		try {

			int aux = lyrVect.getRecordset().getFieldIndexByName(name);

			if (aux == -1)

				throw new RuntimeException("Field " + name + " not found.");

			fieldIndexStreetName = aux;

		} catch (com.hardcode.gdbms.engine.data.driver.DriverException e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		} catch (DriverException e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

	}

	 * @throws GraphException 

	public Route calculateRoute() throws GraphException {

				try {

					populateRoute(idStart, idStop);

				} catch (DriverException e) {

					e.printStackTrace();

					throw new GraphException(e);

				}

		return route;

	private void populateRoute(int idStart, int idEnd) throws DriverException {

		int idEnlace;

		GvNode node;

		GvEdge link;

		double costeEntrada;

		// Trazar el camino desde idEnd hasta idStart hacia atr?s marcando los Enlaces

		double Coste = 0;

		double Coste2 = 0;

		node = graph.getNodeByID(idEnd);

		int from_link = node.getFromLink();

		VectorialAdapter va = (VectorialAdapter) lyrVect.getSource();

		while (node.getIdNode() != idStart)

		{

			idEnlace = from_link;

			if (idEnlace == -1)

			{

				throw new RuntimeException("Fallo al recorrer de manera inversa la soluci?n. Encontrado arco con -1");

				// break; // FALLO!!

			} 

			link = graph.getEdgeByID(idEnlace);

			IFeature feat = va.getFeature(link.getIdArc());

			route.addRouteFeature(feat.getGeometry(), link.getIdArc(), 

					link.getWeight(), link.getDistance(), feat.getAttribute(getFieldIndexStreetName()).toString());

			node = graph.getNodeByID(link.getIdNodeOrig());

			Coste = Coste + link.getWeight();

			Coste2 = Coste2 + link.getDistance();

			// TODO:

			// from_link = node.get_from_link(idEnlace, &costeEntrada);

			from_link = node.getFromLink();

	    }	

	}

	private int getFieldIndexStreetName() {

		return fieldIndexStreetName;

	}

			bestNode = node;

			// System.out.println("LINK " + link.getIdArc() + " from ");

			System.out.println("from " + idStart + " to " + finalNode.getIdNode() + ". node=" + node.getIdNode());

						OJO: ESTO EST? MAL. NO ES IDARC, SINO IDEDGE CON LO QUE HAY QUE TRABAJAR AQUI.

import java.util.ArrayList;

import org.cresques.cts.IProjection;

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

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

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

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

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

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

	FLyrVect lyr;

		IGraph g = netLoader.loadNetwork();

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

		}

		LayerFactory.setDriversPath("../_fwAndami/gvSIG/extensiones/com.iver.cit.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);