root / trunk / extensions / extGraph / src / org / gvsig / graph / core / GvConnector.java @ 25339
History | View | Annotate | Download (2.46 KB)
| 1 |
/* gvSIG. Geographic Information System of the Valencian Government
|
|---|---|
| 2 |
*
|
| 3 |
* Copyright (C) 2007-2008 Infrastructures and Transports Department
|
| 4 |
* of the Valencian Government (CIT)
|
| 5 |
*
|
| 6 |
* This program is free software; you can redistribute it and/or
|
| 7 |
* modify it under the terms of the GNU General Public License
|
| 8 |
* as published by the Free Software Foundation; either version 2
|
| 9 |
* of the License, or (at your option) any later version.
|
| 10 |
*
|
| 11 |
* This program is distributed in the hope that it will be useful,
|
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 14 |
* GNU General Public License for more details.
|
| 15 |
*
|
| 16 |
* You should have received a copy of the GNU General Public License
|
| 17 |
* along with this program; if not, write to the Free Software
|
| 18 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
|
| 19 |
* MA 02110-1301, USA.
|
| 20 |
*
|
| 21 |
*/
|
| 22 |
|
| 23 |
/*
|
| 24 |
* AUTHORS (In addition to CIT):
|
| 25 |
* 2008 Software Colaborativo (www.scolab.es) development
|
| 26 |
*/
|
| 27 |
|
| 28 |
package org.gvsig.graph.core; |
| 29 |
/**
|
| 30 |
* @author Francisco Jos? Pe?arrubia (fjp@scolab.es)
|
| 31 |
*
|
| 32 |
* Each node connects to GvEdge by GvConnectors. Their purpose is to model accurately turnCosts.
|
| 33 |
*
|
| 34 |
*/
|
| 35 |
public class GvConnector { |
| 36 |
private GvEdge edgeIn = null; |
| 37 |
private GvEdge edgeOut = null; |
| 38 |
private int from_link_c; |
| 39 |
private double bestCostIn = Double.MAX_VALUE; // Cost arriving to this connector |
| 40 |
private double bestCostOut = Double.MAX_VALUE; // Cost exiting from this connector |
| 41 |
private boolean mustBeRevised = false; |
| 42 |
|
| 43 |
public int getFrom_link_c() { |
| 44 |
return from_link_c;
|
| 45 |
} |
| 46 |
|
| 47 |
public void setFrom_link_c(int from_link_c) { |
| 48 |
this.from_link_c = from_link_c;
|
| 49 |
} |
| 50 |
|
| 51 |
public double getBestCostIn() { |
| 52 |
return bestCostIn;
|
| 53 |
} |
| 54 |
|
| 55 |
public void setBestCostIn(double bestCostIn) { |
| 56 |
this.bestCostIn = bestCostIn;
|
| 57 |
} |
| 58 |
|
| 59 |
public double getBestCostOut() { |
| 60 |
return bestCostOut;
|
| 61 |
} |
| 62 |
|
| 63 |
public void setBestCostOut(double bestCostOut) { |
| 64 |
this.bestCostOut = bestCostOut;
|
| 65 |
} |
| 66 |
|
| 67 |
public boolean isMustBeRevised() { |
| 68 |
return mustBeRevised;
|
| 69 |
} |
| 70 |
|
| 71 |
public void setMustBeRevised(boolean mustBeRevised) { |
| 72 |
this.mustBeRevised = mustBeRevised;
|
| 73 |
} |
| 74 |
|
| 75 |
public GvEdge getEdgeIn() {
|
| 76 |
return edgeIn;
|
| 77 |
} |
| 78 |
|
| 79 |
public GvEdge getEdgeOut() {
|
| 80 |
return edgeOut;
|
| 81 |
} |
| 82 |
|
| 83 |
public GvConnector() {
|
| 84 |
} |
| 85 |
|
| 86 |
public void setEdgeIn(GvEdge edgeIn) { |
| 87 |
this.edgeIn = edgeIn;
|
| 88 |
} |
| 89 |
|
| 90 |
public void setEdgeOut(GvEdge edgeOut) { |
| 91 |
this.edgeOut = edgeOut;
|
| 92 |
} |
| 93 |
} |
| 94 |
|