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

import java.awt.Color;

import java.text.NumberFormat;

import java.util.Arrays;

import java.util.Random;

import javax.swing.ImageIcon;

import javax.swing.JOptionPane;

import org.gvsig.exceptions.BaseException;

import org.gvsig.graph.core.GraphException;

import org.gvsig.graph.core.GvFlag;

import org.gvsig.graph.core.GvNode;

import org.gvsig.graph.core.IGraph;

import org.gvsig.graph.core.Network;

import org.gvsig.graph.core.NetworkUtils;

import org.gvsig.graph.gui.ConnectivityControlPanel;

import org.gvsig.graph.gui.wizard.servicearea.ServiceAreaWizard;

import org.gvsig.graph.solvers.EdgesMemoryDriver;

import org.gvsig.graph.solvers.OneToManySolver;

import org.gvsig.graph.solvers.ServiceAreaExtractor;

import org.gvsig.graph.solvers.ServiceAreaExtractor2;

import com.hardcode.gdbms.driver.exceptions.ReadDriverException;

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

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

import com.iver.andami.PluginServices;

import com.iver.andami.plugins.Extension;

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

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

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

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

import com.iver.cit.gvsig.fmap.core.symbols.IFillSymbol;

import com.iver.cit.gvsig.fmap.core.symbols.ISymbol;

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

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

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

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

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

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

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

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

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

/**

 * @author fjp

 * 

 * Extension to perform Connectivity calculations. 

 * The user can put a flag and select a point associated layer, and set

 * if he wants to use a max cost and/or max distance.

 * The algorithm will explore the network in reverse order or in normal order and

 * the arcs reached will be selected. If the user selects an associated layer, the

 * points reached will be selected also.

 * This may be useful in the following situations:

 * 1.- Searching for connectivity. The unconnected parts of the network will be unselected.

 * 2.- Selecting points connected to the network and affected by a cut in the graph

 * 3.- Using reverse order, you may find the closest valve to close and avoid leaks.

 */

public class ConnectivityExtension extends Extension {

        private int idSymbolLine = -1;

        public void initialize() {

                PluginServices.getIconTheme().registerDefault(

                                "connectivity",

                                this.getClass().getClassLoader().getResource("images/connectivity.gif")

                        );

        }

        public void execute(String actionCommand) {

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

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

                                if(actionCommand.equals("CONNECTIVITY")){

                                        ImageIcon icon = new ImageIcon(this.getClass().getClassLoader()

                                                        .getResource("images/wizard_connectivity.png"));

                                        ConnectivityControlPanel w =new ConnectivityControlPanel();

                                        try {

                                                w.setMapControl(mapCtrl);

                                                PluginServices.getMDIManager().addWindow(w);                                                

                                        } catch (ReadDriverException e) {

                                                // TODO Auto-generated catch block

                                                e.printStackTrace();

                                        }

                                }

                                return;

                        }

                }

        }

        /**

         * @param mapCtrl

         * @param map

         * @param net

         * @param flags

         * @param solver

         * @return

         * @throws GraphException

         */

        private void calculateLabels(MapControl mapCtrl, MapContext map, Network net, GvFlag[] flags, OneToManySolver solver) throws GraphException {

                GraphicLayer graphicLayer = mapCtrl.getMapContext()

                                .getGraphicsLayer();

                removeOldLabels(graphicLayer);

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

                        solver.setSourceFlag(flags[i]);

                        long t1 = System.currentTimeMillis();

                        solver.setExploreAllNetwork(true);

                        solver.calculate();

                        long t2 = System.currentTimeMillis();

                        System.out.println("Punto " + i + " de "

                                        + flags.length + ". " + (t2 - t1)

                                        + " msecs.");

                        // Despu?s de esto, los nodos de la red est?n

                        // etiquetados con los costes al nodo or?gen

                        EdgesMemoryDriver driver = new EdgesMemoryDriver(net);

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

                        map.getLayers().addLayer(lyr);

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

                }

        }

        private void calculateServiceArea(MapContext map, Network net, GvFlag[] flags, OneToManySolver solver) throws BaseException {

                ServiceAreaExtractor2 extractor = new ServiceAreaExtractor2(net);

                String aux = JOptionPane.showInputDialog("Por favor, introduzca el coste m?ximo del ?rea de servicio:");

                if (aux == null)

                        return;

                double[] costs = NetworkUtils.string2doubleArray(aux, ",");

                Arrays.sort(costs);

                solver.addListener(extractor);

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

                        solver.setSourceFlag(flags[i]);

                        long t1 = System.currentTimeMillis();                        

                        solver.setExploreAllNetwork(true);

                        // TODO: El coste m?ximo deber?a ser un array de costes m?ximos

                        // para obtener varios pol?gonos por cada intervalo. Y 2 opciones m?s:

                        // Si se desea ?rea compacta y

                        // Si los pol?gonos se quieren como anillos conc?ntricos.

                        // Cada Flag deber?a tener asociado un array de costes m?ximos o distancias

                        solver.setMaxCost(costs[costs.length -1]);

                        extractor.setIdFlag(i);

                        extractor.setCosts(costs);

                        extractor.setDoCompactArea(true);

                        solver.calculate();

                        long t2 = System.currentTimeMillis();

                        System.out.println("Punto " + i + " de "

                                        + flags.length + ". " + (t2 - t1)

                                        + " msecs.");

                        extractor.writeServiceArea();

                }

                extractor.closeFiles();

                FLyrVect lyrPol = extractor.getPolygonLayer();

                lyrPol.setProjection(map.getProjection());

                IVectorialUniqueValueLegend defaultLegend = LegendFactory.createVectorialUniqueValueLegend(FShape.POLYGON);

                defaultLegend.setClassifyingFieldNames(new String[] {"COST"} );

                ISymbol myDefaultSymbol = SymbologyFactory.

                        createDefaultSymbolByShapeType(FShape.POLYGON);

                defaultLegend.setDefaultSymbol(myDefaultSymbol);

                DoubleValue clave;

                IFillSymbol theSymbol = null;

                Random rnd = new Random(System.currentTimeMillis());

                for (int j = 0; j < costs.length; j++) {

                        clave = ValueFactory.createValue(costs[j]);

                        if (defaultLegend.getSymbolByValue(clave) == null) {

                                theSymbol =        (IFillSymbol) SymbologyFactory.

                                        createDefaultSymbolByShapeType(FShape.POLYGON);

                                theSymbol.setDescription(clave.toString());

                                Color newColor = new Color(rnd.nextFloat(), 

                                                rnd.nextFloat(),

                                                rnd.nextFloat(), 0.7f);

                                theSymbol.setFillColor(newColor);

                                defaultLegend.addSymbol(clave, theSymbol);

                        }

                } // for

                lyrPol.setLegend(defaultLegend);

                FLyrVect lyrLine = extractor.getLineLayer();

                lyrLine.setProjection(map.getProjection());

                // provisional

                FLyrVect lyrPoints= extractor.getBorderPoints();

                lyrPoints.setProjection(map.getProjection());

                map.beginAtomicEvent();

                map.getLayers().addLayer(lyrPol);

                map.getLayers().addLayer(lyrLine);

                map.getLayers().addLayer(lyrPoints);

                map.endAtomicEvent();

        }

        private FSymbol getTextSymbol() {

                FSymbol theSymbol = new FSymbol(FConstant.SYMBOL_TYPE_TEXT);

                theSymbol.setColor(Color.RED);

                theSymbol.setStyle(FConstant.SYMBOL_STYLE_MARKER_CIRCLE);

                theSymbol.setFontColor(Color.BLACK);

                theSymbol.setSizeInPixels(true);

                theSymbol.setSize(9);

                return theSymbol;

        }

        private void removeOldLabels(GraphicLayer gLyr) {

                for (int i = gLyr.getNumGraphics() - 1; i >= 0; i--) {

                        FGraphic gr = gLyr.getGraphic(i);

                        if (gr.equals("N"))

                                gLyr.removeGraphic(i);

                }

        }

        private void doLabeling(MapControl mapControl, Network net, GvFlag flag) {

                GraphicLayer graphicLayer = mapControl.getMapContext()

                                .getGraphicsLayer();

                IGraph g = net.getGraph();

                int idSymbol = graphicLayer.addSymbol(getTextSymbol());

                String tag = "N";

                for (int i = 0; i < g.numVertices(); i++) {

                        GvNode node = g.getNodeByID(i);

                        IGeometry geom = ShapeFactory.createPoint2D(node.getX(), node

                                        .getY());

                        NumberFormat nf = NumberFormat.getInstance();

                        nf.setMaximumFractionDigits(1);

                        String aux = "\u221E"; // infinito

                        if (node.getBestCost() < Double.MAX_VALUE)

                                aux = nf.format(node.getBestCost()) + " - " + nf.format(node.getAccumulatedLength());

                        FGraphicLabel theGLabel = new FGraphicLabel(geom, idSymbol, aux);

                        theGLabel.setObjectTag(tag);

                        theGLabel.getLabel().setJustification(FLabel.CENTER_TOP);

                        graphicLayer.addGraphic(theGLabel);

                }

                mapControl.drawGraphics();

        }

        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;

        }

}