/*
* GeoTools - The Open Source Java GIS Toolkit
* http://geotools.org
*
* (C) 2002-2008, Open Source Geospatial Foundation (OSGeo)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation;
* version 2.1 of the License.
*
* This library 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
* Lesser General Public License for more details.
*/
package org.geotools.graph.linegraph;
import junit.framework.TestCase;
import org.geotools.graph.build.line.OptDirectedLineGraphGenerator;
import org.geotools.graph.structure.Edge;
import org.geotools.graph.structure.Graph;
import org.geotools.graph.structure.GraphVisitor;
import org.geotools.graph.structure.Graphable;
import org.geotools.graph.structure.line.XYNode;
import com.vividsolutions.jts.geom.Coordinate;
import com.vividsolutions.jts.geom.LineSegment;
/**
*
*
* @source $URL$
*/
public class OptDirectedLineGraphGeneratorTest extends TestCase {
private OptDirectedLineGraphGenerator m_gen;
public OptDirectedLineGraphGeneratorTest(String name) {
super(name);
}
protected void setUp() throws Exception {
super.setUp();
m_gen = createGenerator();
}
/**
* Build a linear graph by adding a number of line segments that join
* at endpoints.
* <BR>
* Expected: 1. Number of edges = number of lines added.
* 2. Number of nodes = number of lines + 1
*
*/
public void test_0() {
final Coordinate base = new Coordinate(0d,0d);
final int n = 5;
for (int i = 1; i <= n; i++) {
Edge e = (Edge)generator().add(
new LineSegment(
new Coordinate(base.x + (i-1), base.y + (i-1)),
new Coordinate(base.x + i, base.y + i)
)
);
}
generator().generate();
Graph built = generator().getGraph();
//ensure correct graph structure
assertTrue(built.getEdges().size() == n);
assertTrue(built.getNodes().size() == n+1);
//ensure coordinates
GraphVisitor visitor = new GraphVisitor() {
public int visit(Graphable component) {
Edge e = (Edge)component;
XYNode a = (XYNode)e.getNodeA();
XYNode b = (XYNode)e.getNodeB();
//coordinats should be a distance of sqrt(2)
//assertTrue(b.getX() == a.getX() + 1 && b.getY() == a.getY() + 1);
assertTrue(
b.getCoordinate().equals(
new Coordinate(a.getCoordinate().x+1, a.getCoordinate().y+1)
)
);
return(0);
}
};
built.visitEdges(visitor);
}
/**
* Build a circular graph of line segments that join at endpoints. <BR>
* <BR>
* Expected: 1. Number of edges = number of nodes = number of lines.
*/
public void test_1() {
final Coordinate base = new Coordinate(0d,0d);
final int n = 100;
for (int i = 1; i <= n; i++) {
Edge e = (Edge)generator().add(
new LineSegment(
new Coordinate(base.x + (i-1), base.y + (i-1)),
new Coordinate(base.x + i, base.y + i)
)
);
}
//complete the circle
generator().add(
new LineSegment(new Coordinate(base.x + n, base.y + n), base)
);
generator().generate();
Graph built = generator().getGraph();
assertTrue(built.getEdges().size() == n+1);
assertTrue(built.getNodes().size() == n+1);
assertTrue(built.getNodesOfDegree(2).size() == n+1);
//ensure coordinates
GraphVisitor visitor = new GraphVisitor() {
public int visit(Graphable component) {
Edge e = (Edge)component;
XYNode a = (XYNode)e.getNodeA();
XYNode b = (XYNode)e.getNodeB();
//coordinats should be a distance of sqrt(2)
if (b.getCoordinate().equals(base))
assertTrue(a.getCoordinate().equals(new Coordinate(n,n)));
else
assertTrue(
b.getCoordinate().equals(
new Coordinate(a.getCoordinate().x+1, a.getCoordinate().y+1)
)
);
// if (b.getX() == base.x && b.getY() == base.y)
// assertTrue(a.getX() == n && a.getY() == n);
// else assertTrue(b.getX() == a.getX() + 1 && b.getY() == a.getY() + 1);
return(0);
}
};
built.visitEdges(visitor);
}
protected OptDirectedLineGraphGenerator createGenerator() {
return(new OptDirectedLineGraphGenerator());
}
protected OptDirectedLineGraphGenerator generator() {
return(m_gen);
}
}