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

import java.awt.BasicStroke;

import java.awt.Color;

import java.awt.Frame;

import java.awt.geom.Point2D;

import java.io.File;

import java.util.Collection;

import java.util.Iterator;

import java.util.List;

import java.util.ListIterator;

import com.iver.andami.PluginServices;

import com.iver.andami.plugins.Extension;

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

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

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

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

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

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

import com.iver.cit.gvsig.fmap.core.v02.FSymbol;

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

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

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

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

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

import com.iver.cit.gvsig.fmap.rendering.FGraphic;

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

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

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

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

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

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

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

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 com.iver.cit.gvsig.graph.ui.DlgDirections;

import com.iver.cit.gvsig.project.documents.view.gui.View;

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

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

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

import edu.uci.ics.jung.graph.decorators.Indexer;

public class TestExtension extends Extension {

        public static ShortestPathSolver solver = new ShortestPathSolver();

        private int idSymbolLine = -1;

        public void initialize() {

        }

        public void execute(String actionCommand) {

                View v = (View) PluginServices.getMDIManager().getActiveWindow();

                MapContext map = v.getMapControl().getMapContext();

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

                while (it.hasNext())

                {

                        FLayer aux = it.next();

                        if (!aux.isActive())

                                continue;

                        Network net = new Network();

                        net.setLayer((FLyrVect) aux);

                        NetworkRedLoader netLoader = new NetworkRedLoader();

                        netLoader.setNetFile(new File("c:/ejes.red"));

                        IGraph g = netLoader.loadNetwork();

                        net.setGraph(g);

                        // Primer punto

                        net.addFlag(433647.09375, 4488029, 10);

                        // Segundo punto

                        net.addFlag(437290.96875, 4481547, 10);

                        Route route;

                        try {

                                solver.setNetwork(net);

                                solver.setFielStreetName("Nombre");

                                route = solver.calculateRoute();

                                DlgDirections dlg = new DlgDirections((Frame) PluginServices.getMainFrame(), false);

                                dlg.setModel(route.getFeatureList());

                                createGraphicsFrom(route.getFeatureList(), v.getMapControl());

                                dlg.setVisible(true);

                                System.out.println("distancia fjp:" + route.getCost());

                                // PROBAMOS JUNG

                                JungGraph jG = new JungGraph(net.getGraph());

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

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

                                List path = distCalculator.getPath(vOrig, vEnd);

                        createGraphicsFrom(path.listIterator(), v.getMapControl());

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

                        } catch (DriverException e) {

                                // TODO Auto-generated catch block

                                e.printStackTrace();

                        }

                }

        }

        private void createGraphicsFrom(Collection featureList, MapControl mapControl) {

                Iterator it = featureList.iterator();

                GraphicLayer graphicLayer = mapControl.getMapContext().getGraphicsLayer();

                if (idSymbolLine == -1)

                {

                        Color color = new Color(0.9f, 0.0f, 0.0f, 0.3f);

                        FSymbol lineSymbol = new FSymbol(FShape.LINE, color);

                        lineSymbol.setStroke(new BasicStroke(3.0f));

                        idSymbolLine = graphicLayer.addSymbol(lineSymbol);

                }

                while (it.hasNext()) {

                        IFeature feat = (IFeature) it.next();

                        IGeometry gAux = feat.getGeometry();

                        FGraphic graphic = new FGraphic(gAux, idSymbolLine);

                        graphicLayer.addGraphic(graphic);

                }

                mapControl.drawGraphics();

        }

        private void createGraphicsFrom(ListIterator it, MapControl mapControl) throws DriverException {

                GraphicLayer graphicLayer = mapControl.getMapContext().getGraphicsLayer();

                Color color = new Color(0.5f, 0.8f, 0.0f, 0.5f);

                FSymbol lineSymbol = new FSymbol(FShape.LINE, color);

                lineSymbol.setStroke(new BasicStroke(7.0f));

                int idSymbol = graphicLayer.addSymbol(lineSymbol);

                VectorialAdapter va = (VectorialAdapter) solver.getNetwork().getLayer().getSource();

                while (it.hasNext()) {

                        FEdge edge = (FEdge) it.next();

                        IFeature feat = va.getFeature(edge.getArcID());

                        IGeometry gAux = feat.getGeometry();

                        FGraphic graphic = new FGraphic(gAux, idSymbol);

                        graphicLayer.addGraphic(graphic);

                }

                mapControl.drawGraphics();

        }

        public boolean isEnabled() {

                // TODO Auto-generated method stub

                return true;

        }

        public boolean isVisible() {

                // TODO Auto-generated method stub

                return true;

        }

}