Revision 20099 tags/v1_1_2_Build_1044/prototypes/VectorialAvanzado/extensions/extGraph/src-test/com/iver/cit/gvsig/graphtests/TestLoader.java
| TestLoader.java | ||
|---|---|---|
| 23 | 23 |
import com.iver.cit.gvsig.fmap.layers.FLyrVect; |
| 24 | 24 |
import com.iver.cit.gvsig.fmap.layers.LayerFactory; |
| 25 | 25 |
import com.iver.cit.gvsig.fmap.layers.SelectableDataSource; |
| 26 |
import com.iver.cit.gvsig.graph.GraphException; |
|
| 27 | 26 |
import com.iver.cit.gvsig.graph.core.EdgeWeightLabeller; |
| 28 | 27 |
import com.iver.cit.gvsig.graph.core.FNode; |
| 28 |
import com.iver.cit.gvsig.graph.core.GraphException; |
|
| 29 | 29 |
import com.iver.cit.gvsig.graph.core.IGraph; |
| 30 | 30 |
import com.iver.cit.gvsig.graph.core.JungGraph; |
| 31 | 31 |
import com.iver.cit.gvsig.graph.core.Network; |
| ... | ... | |
| 120 | 120 |
* Test method for |
| 121 | 121 |
* 'com.iver.cit.gvsig.graph.core.NetworkLoader.loadNetwork()' |
| 122 | 122 |
*/ |
| 123 |
public void testLoadNetwork() {
|
|
| 124 |
// if (true) return; |
|
| 125 |
NetworkLoader netLoader = new NetworkLoader(true); |
|
| 123 |
// public void testLoadNetwork() {
|
|
| 124 |
// // if (true) return; |
|
| 125 |
// NetworkLoader netLoader = new NetworkLoader(true); |
|
| 126 |
// |
|
| 127 |
// DataSource dsNodes; |
|
| 128 |
// try {
|
|
| 129 |
// dsNodes = dsf.createRandomDataSource("nodes",
|
|
| 130 |
// DataSourceFactory.MANUAL_OPENING); |
|
| 131 |
// |
|
| 132 |
// DataSource dsEdges = dsf.createRandomDataSource("edges",
|
|
| 133 |
// DataSourceFactory.MANUAL_OPENING); |
|
| 134 |
// |
|
| 135 |
// SelectableDataSource sdsNodes = new SelectableDataSource(dsNodes); |
|
| 136 |
// SelectableDataSource sdsEdges = new SelectableDataSource(dsEdges); |
|
| 137 |
// |
|
| 138 |
// netLoader.setNodeReader(sdsNodes); |
|
| 139 |
// netLoader.setEdgeReader(sdsEdges); |
|
| 140 |
// |
|
| 141 |
// Graph g = netLoader.loadJungNetwork(); |
|
| 142 |
// |
|
| 143 |
// System.out.println("Num nodos=" + g.numVertices() + " numEdges = "
|
|
| 144 |
// + g.numEdges()); |
|
| 145 |
// |
|
| 146 |
// // Probamos la algoritmia: distancia entre nodo 1 y nodo 1000 |
|
| 147 |
// DijkstraDistance distCalculator = new DijkstraDistance(g, |
|
| 148 |
// new EdgeWeightLabeller()); |
|
| 149 |
// ArchetypeVertex vOrig = netLoader.getIndexer().getVertex(1); |
|
| 150 |
// ArchetypeVertex vEnd = netLoader.getIndexer().getVertex(1000); |
|
| 151 |
// long t1 = System.currentTimeMillis(); |
|
| 152 |
// Number dist = distCalculator.getDistance(vOrig, vEnd); |
|
| 153 |
// long t2 = System.currentTimeMillis(); |
|
| 154 |
// |
|
| 155 |
// // assertEquals(dist.doubleValue(), 8887, 0); |
|
| 156 |
// |
|
| 157 |
// System.out |
|
| 158 |
// .println("dist =" + dist + " meters. msecs: " + (t2 - t1));
|
|
| 159 |
// System.out.println(vOrig + " - " + vEnd); |
|
| 160 |
// System.out.println(vOrig.getUserDatum("X") + ", "
|
|
| 161 |
// + vOrig.getUserDatum("Y") + " - " + vEnd.getUserDatum("X")
|
|
| 162 |
// + ", " + vEnd.getUserDatum("Y"));
|
|
| 163 |
// |
|
| 164 |
// } catch (DriverLoadException e) {
|
|
| 165 |
// // TODO Auto-generated catch block |
|
| 166 |
// e.printStackTrace(); |
|
| 167 |
// } catch (NoSuchTableException e) {
|
|
| 168 |
// // TODO Auto-generated catch block |
|
| 169 |
// e.printStackTrace(); |
|
| 170 |
// } catch (DriverException e) {
|
|
| 171 |
// // TODO Auto-generated catch block |
|
| 172 |
// e.printStackTrace(); |
|
| 173 |
// } |
|
| 174 |
// |
|
| 175 |
// } |
|
| 126 | 176 |
|
| 127 |
DataSource dsNodes; |
|
| 128 |
try {
|
|
| 129 |
dsNodes = dsf.createRandomDataSource("nodes",
|
|
| 130 |
DataSourceFactory.MANUAL_OPENING); |
|
| 131 |
|
|
| 132 |
DataSource dsEdges = dsf.createRandomDataSource("edges",
|
|
| 133 |
DataSourceFactory.MANUAL_OPENING); |
|
| 134 |
|
|
| 135 |
SelectableDataSource sdsNodes = new SelectableDataSource(dsNodes); |
|
| 136 |
SelectableDataSource sdsEdges = new SelectableDataSource(dsEdges); |
|
| 137 |
|
|
| 138 |
netLoader.setNodeReader(sdsNodes); |
|
| 139 |
netLoader.setEdgeReader(sdsEdges); |
|
| 140 |
|
|
| 141 |
Graph g = netLoader.loadJungNetwork(); |
|
| 142 |
|
|
| 143 |
System.out.println("Num nodos=" + g.numVertices() + " numEdges = "
|
|
| 144 |
+ g.numEdges()); |
|
| 145 |
|
|
| 146 |
// Probamos la algoritmia: distancia entre nodo 1 y nodo 1000 |
|
| 147 |
DijkstraDistance distCalculator = new DijkstraDistance(g, |
|
| 148 |
new EdgeWeightLabeller()); |
|
| 149 |
ArchetypeVertex vOrig = netLoader.getIndexer().getVertex(1); |
|
| 150 |
ArchetypeVertex vEnd = netLoader.getIndexer().getVertex(1000); |
|
| 151 |
long t1 = System.currentTimeMillis(); |
|
| 152 |
Number dist = distCalculator.getDistance(vOrig, vEnd); |
|
| 153 |
long t2 = System.currentTimeMillis(); |
|
| 154 |
|
|
| 155 |
// assertEquals(dist.doubleValue(), 8887, 0); |
|
| 156 |
|
|
| 157 |
System.out |
|
| 158 |
.println("dist =" + dist + " meters. msecs: " + (t2 - t1));
|
|
| 159 |
System.out.println(vOrig + " - " + vEnd); |
|
| 160 |
System.out.println(vOrig.getUserDatum("X") + ", "
|
|
| 161 |
+ vOrig.getUserDatum("Y") + " - " + vEnd.getUserDatum("X")
|
|
| 162 |
+ ", " + vEnd.getUserDatum("Y"));
|
|
| 163 |
|
|
| 164 |
} catch (DriverLoadException e) {
|
|
| 165 |
// TODO Auto-generated catch block |
|
| 166 |
e.printStackTrace(); |
|
| 167 |
} catch (NoSuchTableException e) {
|
|
| 168 |
// TODO Auto-generated catch block |
|
| 169 |
e.printStackTrace(); |
|
| 170 |
} catch (DriverException e) {
|
|
| 171 |
// TODO Auto-generated catch block |
|
| 172 |
e.printStackTrace(); |
|
| 173 |
} |
|
| 174 |
|
|
| 175 |
} |
|
| 176 |
|
|
| 177 | 177 |
protected void setUp() throws Exception {
|
| 178 | 178 |
// Setup de los drivers |
| 179 | 179 |
LayerFactory |
Also available in: Unified diff