Package org.geotools.graph.structure

Examples of org.geotools.graph.structure.Node

88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
   *
   */
  public void test_1() {
    int k = 4;
    Object[] obj = GraphTestUtil.buildPerfectBinaryTree(builder(), k);
    Node root = (Node)obj[0];
    Map id2node = (Map)obj[1];
   
    Node lc = (Node)id2node.get("0.0");
    Node rc = (Node)id2node.get("0.1");
   
    builder().removeNode(root);
   
    GraphPartitioner parter = new GraphPartitioner(builder().getGraph());
    parter.partition();
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
      };
      after.visitEdges(visitor);
     
      visitor = new GraphVisitor() {
        public int visit(Graphable component) {
          Node n = (Node)component;
         
          if (n.getDegree() == 1) {
            assertTrue(n.getID() == 0 || n.getID() == nnodes-1); 
          }
          else {
            assertTrue(n.getDegree() == 2);
           
            Edge e0 = (Edge)n.getEdges().get(0);
            Edge e1 = (Edge)n.getEdges().get(1);
           
            assertTrue(
              (e0.getID() == n.getID()-1 && e1.getID() == n.getID()) ||
              (e1.getID() == n.getID()-1 && e0.getID() == n.getID())
            );
           
          }
         
          return(0);
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
   *
   */
  public void test_1() {
    final int k = 5;
    Object[] obj = GraphTestUtil.buildPerfectBinaryTree(builder(), k);
    final Node root = (Node)obj[0];
    final Map obj2node = (Map)obj[1];   
   
    try {
      File victim = File.createTempFile( "graph", null );
      victim.deleteOnExit();
      m_serializer.setProperty(SerializedReaderWriter.FILENAME, victim.getAbsolutePath() );
     
      m_serializer.write(builder().getGraph());
     
      Graph before = builder().getGraph();
      Graph after = m_serializer.read();
     
      //ensure same number of nodes and edges
      assertTrue(before.getNodes().size() == after.getNodes().size());
      assertTrue(before.getEdges().size() == after.getEdges().size());
     
      //ensure same structure
      GraphVisitor visitor = new GraphVisitor() {
        public int visit(Graphable component) {
          Node n = (Node)component;
          String id = (String)n.getObject();
         
          assertTrue(obj2node.get(id) != null);
         
          StringTokenizer st = new StringTokenizer(id, ".");
         
          if (st.countTokens() == 1) {
            //root
            assertTrue(n.getDegree() == 2);
           
            Node n0 = ((Edge)n.getEdges().get(0)).getOtherNode(n);
            Node n1 = ((Edge)n.getEdges().get(1)).getOtherNode(n);
           
            assertTrue(
              n0.getObject().equals("0.0") && n1.getObject().equals("0.1")
           || n0.getObject().equals("0.1") && n1.getObject().equals("0.0")
            );
          }
          else if (st.countTokens() == k+1) {
            //leaf
            assertTrue(n.getDegree() == 1);
           
            Node parent = ((Edge)n.getEdges().get(0)).getOtherNode(n);
            String parentid = (String)parent.getObject();
           
            assertTrue(parentid.equals(id.substring(0, id.length()-2)));  
          }
          else {
            //internal
View Full Code Here
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
      assertTrue(before.getNodes().size() == after.getNodes().size());
      assertTrue(before.getEdges().size() == after.getEdges().size());
     
      GraphVisitor visitor = new GraphVisitor() {
        public int visit(Graphable component) {
          Node n = (Node)component;
          if (n.getID() == 0 || n.getID() == nnodes-1)
            assertTrue(n.getDegree() == 0);
          else if (n.getID() == 1 || n.getID() == nnodes-2)
            assertTrue(n.getDegree() == 1);
          else assertTrue(n.getDegree() == 2);
          
          return(0);
        }
      };
      after.visitNodes(visitor);
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
    assertTrue(built.getEdges().size() == n);
    assertTrue(built.getNodes().size() == n+1);
   
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        Node node = (Node)component;
        Coordinate c = (Coordinate)node.getObject();
       
        if (node.getDegree() == 1) {
          assertTrue(node.getID() == 0 || node.getID() == n);
        }
        else {
          assertTrue(node.getDegree() == 2);
        }
       
        assertTrue(
          c.x == base.x + node.getID() && c.y == base.y + node.getID()
        );
        return(0);
      }
    };
    built.visitNodes(visitor);
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
        // init the distance
      double dist = 999999999;
     
      // Loops through the nodes of the graph and finds the node closest to the point of interest
      for (Object object:graph.getNodes()) {
        Node node = (Node) object;
        Point point = ((Point) node.getObject());
            //Logger.d(this.getClass().getSimpleName() + " node: " + node + ", point: " + point);
        double nodeDist = calculateDistance(destinationPoint.getX(), destinationPoint.getY(), point.getCoordinate().x,
                    point.getCoordinate().y,
                    coordinateReferenceSystem);
            //Logger.d(this.getClass().getSimpleName() + " nodeDist: " + nodeDist);
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
        }
        //build the graph
        networkGraph = featureGen.getGraph();

        //find the node of the graph closest to the origin point and returns the node
        Node source = nodeHelper.getNearestGraphNode(lineStringGen, networkGraph, originPoint, coordinateReferenceSystem);
        //distance between the origin location and the nearest graph node
        distanceOriginToGraph = nodeHelper.getDistanceFromGraphNode();

        //weight the edges of the graph using the distance of each linestring
        EdgeWeighter edgeWeighter = new EdgeWeighter() {
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
    public boolean calculateRouteFeature(Point originPoint, Point destinationPoint, int id) throws SchemaException, TransformException {
        //this calculates the route and builds a FeatureCollection of route objects, to do this the geometries of the various
        //linestrings contained within a path object (e.g. each road that makes up the route) must be merged to make one feature

        //get the graph node closest to the destination point object
        Node destination = nodeHelper.getNearestGraphNode(lineStringGen, networkGraph, destinationPoint, coordinateReferenceSystem);
        //get the path (route) from origin to destination
        Logger.d("Calc route feature, destination: " + destination);
        Path path = shortestPathFinder.getPath(destination);
        //Logger.d("Calc route feature, path: " + path);

        //this happens if the closest node is the endpoint of a disconnected line
        if (path == null) {
            Logger.w("Could not calculate the route to this destination" +
                    ". There is probably a problem with the network data set (dangles etc ...)");
            return false;
        }

        //create a vector object to store all the edges
        Vector result = new Vector();
        Node previous = null;
        Node node;

        //iterate through the path object getting each node and it's neighbour and build edge objects from them
        for (Iterator iterator = path.riterator(); iterator.hasNext();) {
            node = (Node) iterator.next();
            if (previous != null) {
                // Adds the resulting edge into the vector
                result.add(node.getEdge(previous));
            }
            previous = node;
        }

        //create an array to store the geometry of each Edge linestring that will need to be merged into one Route object
View Full Code Here
215
216
217
218
219
220
221
222
        return DataUtilities.source(routeFeatures);
    }

    public void calculateCostArrayList(Point originPoint, Point destinationPoint) throws SchemaException, TransformException {
        //calculates the cost between an origin and destination point
        Node destination = nodeHelper.getNearestGraphNode(lineStringGen, networkGraph, destinationPoint, coordinateReferenceSystem);
        Costs.add(shortestPathFinder.getCost(destination));
    }
View Full Code Here
TOP

Related Classes of org.geotools.graph.structure.Node

  • business.CalculateRoutes
  • business.NodeHelper
  • org.geotools.graph.build.basic.BasicDirectedGraphBuilderTest
  • org.geotools.graph.build.basic.BasicGraphBuilder
  • org.geotools.graph.build.basic.BasicGraphBuilderTest
  • org.geotools.graph.build.basic.BasicGraphGenerator
  • org.geotools.graph.build.line.BasicLineGraphGenerator
  • org.geotools.graph.build.line.OptDirectedLineGraphGenerator
  • org.geotools.graph.build.line.OptLineGraphGenerator
  • org.geotools.graph.build.opt.OptDirectedGraphBuilderTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.