Application: gvSIG desktop

	private int idArcFrom;

	private int idArcTo;

	private double cost;

	public double getCost() {

		return cost;

	}

	public void setCost(double cost) {

		this.cost = cost;

	}

	public int getIdArcFrom() {

		return idArcFrom;

	}

	public void setIdArcFrom(int idArcFrom) {

		this.idArcFrom = idArcFrom;

	}

	public int getIdArcTo() {

		return idArcTo;

	}

	public void setIdArcTo(int idArcTo) {

		this.idArcTo = idArcTo;

	}

/*

 * Created on 06-nov-2006

 *

 * 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

 */

/* CVS MESSAGES:

 *

 * $Id$

 * $Log$

 * Revision 1.1.2.1  2007-08-08 11:43:40  fjp

 * Principio de giros y area de influencia

 *

 * Revision 1.2  2006/11/08 19:32:36  azabala

 * *** empty log message ***

 *

 * Revision 1.1  2006/11/07 19:49:28  azabala

 * *** empty log message ***

 *

 *

 */

package com.iver.cit.gvsig.graph.solvers;

import java.awt.geom.Line2D;

import java.awt.geom.Rectangle2D;

import java.io.IOException;

import java.sql.Types;

import java.util.List;

import javax.swing.table.DefaultTableModel;

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

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

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

import com.hardcode.gdbms.engine.data.edition.DataWare;

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

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

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

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

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

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

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

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

import com.iver.cit.gvsig.fmap.drivers.DriverAttributes;

import com.iver.cit.gvsig.fmap.drivers.FieldDescription;

import com.iver.cit.gvsig.fmap.drivers.MemoryDriver;

import com.iver.cit.gvsig.fmap.drivers.VectorialDriver;

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

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

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

/**

 * Driver wrapper around arcs from a network. It may be useful to show

 * the arcs as a layer without consuming more memory. Maybe it could be useful

 * also to have an Edges version instead of Arcs.

 * 

 * @author Fco. Jos? Pe?arrubia

 * 

 */

public class EdgesMemoryDriver implements VectorialDriver, ObjectDriver {

	static FieldDescription[] fields = new FieldDescription[6];

	static {

		FieldDescription fieldDesc = new FieldDescription();

		fieldDesc.setFieldName("IDARC");

		fieldDesc.setFieldType(Types.INTEGER);

		fieldDesc.setFieldLength(20);

		fieldDesc.setFieldDecimalCount(0);

		fields[0] = fieldDesc;

		fieldDesc = new FieldDescription();

		fieldDesc.setFieldName("WEIGHT");

		fieldDesc.setFieldType(Types.DOUBLE);

		fieldDesc.setFieldLength(20);

		fieldDesc.setFieldDecimalCount(5);

		fields[1] = fieldDesc;

		fieldDesc = new FieldDescription();

		fieldDesc.setFieldName("LENGTH");

		fieldDesc.setFieldType(Types.DOUBLE);

		fieldDesc.setFieldLength(20);

		fieldDesc.setFieldDecimalCount(5);

		fields[2] = fieldDesc;

		fieldDesc = new FieldDescription();

		fieldDesc.setFieldName("TEXT");

		fieldDesc.setFieldType(Types.VARCHAR);

		fieldDesc.setFieldLength(25);

		fieldDesc.setFieldDecimalCount(0);

		fields[3] = fieldDesc;

		fieldDesc = new FieldDescription();

		fieldDesc.setFieldName("COSTN1");

		fieldDesc.setFieldType(Types.DOUBLE);

		fieldDesc.setFieldLength(20);

		fieldDesc.setFieldDecimalCount(5);

		fields[4] = fieldDesc;

		fieldDesc = new FieldDescription();

		fieldDesc.setFieldName("COSTN2");

		fieldDesc.setFieldType(Types.DOUBLE);

		fieldDesc.setFieldLength(20);

		fieldDesc.setFieldDecimalCount(5);

		fields[5] = fieldDesc;

	}

	Network net;

	Rectangle2D fullExtent;

	public EdgesMemoryDriver(Network net) {

		this.net = net;

	}

	public int getShapeType() {

		return FShape.LINE;

	}

	public String getName() {

		return "EdgeDriver";

	}

	public DriverAttributes getDriverAttributes() {

		return null;

	}

	public boolean isWritable() {

		return false;

	}

	public int[] getPrimaryKeys()

			throws com.hardcode.gdbms.engine.data.driver.DriverException {

		return null;

	}

	public void write(DataWare dataWare)

			throws com.hardcode.gdbms.engine.data.driver.DriverException {

	}

	/**

	 * Returns de field type of the specified field index.

	 * 

	 * @return field type of i field

	 */

	public int getFieldType(int i) throws DriverException {

		// azabala: we overwrite MemoryDriver because type resolution

		// is based in first register value (it could be null)

		if (i >= fields.length)

			throw new DriverException("Excedido el numero de campos");

		return fields[i].getFieldType();

	}

	public int getShapeCount() throws IOException {

		return net.getGraph().numEdges();

	}

	public Rectangle2D getFullExtent() throws IOException {

		try {

			return net.getLayer().getFullExtent();

		} catch (com.iver.cit.gvsig.fmap.DriverException e) {

			e.printStackTrace();

			throw new IOException(e.getMessage());

		}

	}

	public IGeometry getShape(int index) {

		GvEdge edge = net.getGraph().getEdgeByID(index);

		GvNode n1 = net.getGraph().getNodeByID(edge.getIdNodeOrig());

		GvNode n2 = net.getGraph().getNodeByID(edge.getIdNodeEnd());

		Line2D.Double line = new Line2D.Double(n1.getX(), n1.getY(), n2.getX(), n2.getY());

		return ShapeFactory.createPolyline2D(new GeneralPathX(line));

	}

	public void reload() throws IOException, DriverException {

	}

	/* (non-Javadoc)

	 * @see com.hardcode.gdbms.engine.data.ReadDriver#getFieldValue(long, int)

	 */

	public Value getFieldValue(long rowIndex, int fieldId)

		throws DriverException {

		Value val = ValueFactory.createNullValue();

		GvEdge edge = net.getGraph().getEdgeByID((int) rowIndex);

		switch (fieldId)

		{

		case 0: // idArc

			return ValueFactory.createValue(edge.getIdArc());

		case 1: // weight

			return ValueFactory.createValue(edge.getWeight());

		case 2: // length

			return ValueFactory.createValue(edge.getDistance());

		case 3:

			return ValueFactory.createValue(edge.getType() + "");

		case 4: // cost node1

			GvNode n1 = net.getGraph().getNodeByID(edge.getIdNodeOrig());

			if (n1.getBestCost() == Double.MAX_VALUE)

				return ValueFactory.createValue(-1.0);

			else

				return ValueFactory.createValue(n1.getBestCost());

		case 5: // cost node2

			GvNode n2 = net.getGraph().getNodeByID(edge.getIdNodeOrig());

			if (n2.getBestCost() == Double.MAX_VALUE)

				return ValueFactory.createValue(-1.0);

			else

				return ValueFactory.createValue(n2.getBestCost());

		}

		return val;

	}

	public int getFieldCount() throws DriverException {

		return fields.length;

	}

	public String getFieldName(int fieldId) throws DriverException {

		return fields[fieldId].getFieldName();

	}

	/* (non-Javadoc)

	 * @see com.hardcode.gdbms.engine.data.ReadDriver#getRowCount()

	 */

	public long getRowCount() throws DriverException {

		return net.getGraph().numEdges();

	}

    /* (non-Javadoc)

     * @see com.hardcode.gdbms.engine.data.driver.GDBMSDriver#setDataSourceFactory(com.hardcode.gdbms.engine.data.DataSourceFactory)

     */

    public void setDataSourceFactory(DataSourceFactory dsf) {

    }

    public int getFieldWidth(int fieldId)

    {

    	return fields[fieldId].getFieldLength();

    }

}

		GvTurn theTurn;

		// Cada nodo y cada arco llevan un numero de soluci?n. Se supone

						theTurn = (GvTurn) node.getTurns().get(idGiro);

						 if ((theTurn.getIdArcFrom() ==	 graph.getEdgeByID(node.getFromLink()).getIdArc()) &&

								 (theTurn.getIdArcTo() == link.getIdArc()))

						 {

							 if (theTurn.getCost() < 0)

							 {

								 bGiroProhibido = true;

								 // No podemos inicializar por completo el nodo porque entonces

								 // perdemos el fromLink (el arco desde donde hemos llegado hasta

								 // este nodo, que es necesario para calcular los costes y generar

								 // el shape recorriendo hacia atr?s el camino realizado.

								 // Si hab?a m?s de un nodo con costes prohibidos, cab?a la posibilidad

								 // de que perdieramos este enlace.

								 // Para que pueda volver a entrar en c?lculos

								 node.setStatus(GvNode.statNotInList);

								 node.setBestCost(Double.MAX_VALUE);						

							 }

							 else

								 newCost += theTurn.getCost();

							 break; // Salimos del for porque ya hemos encontrado el giro

						 }

import com.iver.andami.ui.mdiManager.IWindow;

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

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

//					setVelocities(net);

							EdgesMemoryDriver driver = new EdgesMemoryDriver(net);

							FLayer lyr = LayerFactory.createLayer("Edges", driver, null);

							map.getLayers().addLayer(lyr);

							// doLabeling(mapCtrl, net, flags[i]);

	public boolean isEnabled() {

		IWindow window = PluginServices.getMDIManager().getActiveWindow();

		if (window instanceof View)

		{

			View v = (View) window;

	        MapControl mapCtrl = v.getMapControl();

			MapContext map = mapCtrl.getMapContext();

			SingleLayerIterator it = new SingleLayerIterator(map.getLayers());

			while (it.hasNext())

			{

				FLayer aux = it.next();

				if (!aux.isActive())

					continue;

				Network net = (Network) aux.getProperty("network");

				if ( net != null)

				{

					return true;

				}

			}

		return false;

	}

	public boolean isVisible() {

		IWindow f = PluginServices.getMDIManager()

		 .getActiveWindow();

		if (f == null) {

		    return false;

		if (f instanceof View) {

			return true;

		}

		return false;