Package org.geotools.graph.traverse.basic

Examples of org.geotools.graph.traverse.basic.CountingWalker

107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
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
  public void test_1() {
    int nnodes = 100;
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), nnodes);
    final int suspend = 50;
   
    CountingWalker walker = new CountingWalker() {
      int m_mode = 0;
      public int visit(Graphable element, GraphTraversal traversal) {
        super.visit(element, traversal);
        if (m_mode == 0) {
          if (element.getID() == suspend) {
            m_mode++;
            return(GraphTraversal.SUSPEND);
          } 
        }
        else if (m_mode == 1) {
          assertTrue(element.getID() == suspend+1);
          m_mode++; 
        }
        return(GraphTraversal.CONTINUE);
      }
    };
   
    final DijkstraIterator iterator = createIterator();
    iterator.setSource(ends[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component.getID() <= suspend) assertTrue(component.isVisited());
        else assertTrue(!component.isVisited());
        return 0;
      }
    };
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == nnodes-suspend+1);
   
    //resume
    traversal.traverse();
   
    visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        assertTrue(component.isVisited());
        assertTrue(iterator.getCost(component) == (double)component.getID());
        if (component.getID() == 0) assertNull(iterator.getParent(component));
        else assertTrue(
          iterator.getParent(component).getID() == component.getID() - 1
        );
           
        return 0;
      }
    };
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == nnodes);
  }
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
  public void test_2() {
    int nnodes = 100;
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), nnodes);
    final int kill = 50;
   
    CountingWalker walker = new CountingWalker() {
      int m_mode = 0;
      public int visit(Graphable element, GraphTraversal traversal) {
        super.visit(element, traversal);
        if (m_mode == 0) {
          if (element.getID() == kill) {
            m_mode++;
            return(GraphTraversal.KILL_BRANCH);
          } 
        }
       
        return(GraphTraversal.CONTINUE);
      }
    };
   
    final DijkstraIterator iterator = createIterator();
    iterator.setSource(ends[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component.getID() <= kill) assertTrue(component.isVisited());
        else assertTrue(!component.isVisited());
       
        return 0;
      }
    };
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == nnodes-kill+1);
   
    //resume
    traversal.traverse();
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == nnodes-kill+1);
  }
View Full Code Here
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
  public void test_3() {
    int k = 4;
    Object[] obj = GraphTestUtil.buildPerfectBinaryTree(builder(), k);
    final Node root = (Node)obj[0];
   
    CountingWalker walker = new CountingWalker();
    final DijkstraIterator iterator = createIterator();
    iterator.setSource((Node)obj[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        assertTrue(component.isVisited());
        String id = component.getObject().toString();
        StringTokenizer st = new StringTokenizer(id, ".");
       
        assertTrue(iterator.getCost(component) == (double)st.countTokens()-1);
        if (component != root) {
          String parentid = id.substring(0, id.length()-2);
          assertTrue(
           iterator.getParent(component).getObject().toString().equals(parentid)
          );
        }
       
        return 0;
      }
    };
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == Math.pow(2,k+1)-1);
  }
View Full Code Here
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
   
    final Node root = (Node)obj[0];
    final Node lc = (Node)id2node.get(root.getObject().toString() + ".0");
    final Node rc = (Node)id2node.get(root.getObject().toString() + ".1");
   
    CountingWalker walker = new CountingWalker() {
      private int m_mode = 0;
     
      public int visit(Graphable element, GraphTraversal traversal) {
        super.visit(element, traversal);
        if (m_mode == 0) {
          if (element == rc) {
            m_mode++;
            return(GraphTraversal.SUSPEND);
          }   
        }
        return(GraphTraversal.CONTINUE); 
      }
    };
   
    final DijkstraIterator iterator = createIterator();
    iterator.setSource((Node)obj[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component != root && component != lc && component != rc)
          assertTrue(!component.isVisited());
       
        return 0;
      }
    };
    builder().getGraph().visitNodes(visitor);
   
    //resume
    traversal.traverse();
   
    visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        assertTrue(component.isVisited());
        return(0); 
      } 
    };
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == Math.pow(2,k+1)-1);
  }
View Full Code Here
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
   
    final Node root = (Node)obj[0];
    final Node lc = (Node)id2node.get(root.getObject().toString() + ".0");
    final Node rc = (Node)id2node.get(root.getObject().toString() + ".1");
   
    CountingWalker walker = new CountingWalker() {
      private int m_mode = 0;
     
      public int visit(Graphable element, GraphTraversal traversal) {
        super.visit(element, traversal);
        if (m_mode == 0) {
          if (element == rc) {
            m_mode++;
            return(GraphTraversal.KILL_BRANCH);
          }   
        }
        return(GraphTraversal.CONTINUE); 
      }
    };
   
    final DijkstraIterator iterator = createIterator();
    iterator.setSource((Node)obj[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component == root || component == lc || component == rc)
          assertTrue(component.isVisited());
        else {
          String id = component.getObject().toString();
          if (id.startsWith("0.1.")) assertTrue(!component.isVisited());
          else assertTrue(component.isVisited());
        }
       
        return 0;
      }
    };
    builder().getGraph().visitNodes(visitor);
   
    assertTrue(walker.getCount() == Math.pow(2,k)+1);
  }
View Full Code Here
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
   */
  public void test_6() {
    int nnodes = 100;
    Node[] ends = GraphTestUtil.buildCircular(builder(), nnodes);   
   
    CountingWalker walker = new CountingWalker();
   
    final DijkstraIterator iterator = createIterator();
    iterator.setSource(ends[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        Graphable parent = iterator.getParent(component);
        if (component.getID() < 50 && component.getID() > 0) {
          assertTrue(iterator.getCost(component) == (double)component.getID());
          assertTrue(parent.getID() == component.getID() - 1);
        }
        else if (component.getID() > 50 && component.getID() < 99) {
          assertTrue(
            iterator.getCost(component) == (double)100 - component.getID()
          );
          assertTrue(parent.getID() == component.getID() + 1);
        }
        else if (component.getID() == 0) {
          assertTrue(parent == null);
          assertTrue(iterator.getCost(component) == 0d); 
        }
        else if (component.getID() == 99) {
          assertTrue(parent.getID() == 0);
          assertTrue(iterator.getCost(component) == 1d);
        }
       
        return(0);
      }
    };
   
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == nnodes);
  }
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
   */
  public void test_0() {
    int nnodes = 100;
    GraphTestUtil.buildNoBifurcations(builder(), nnodes);
   
    CountingWalker walker = new CountingWalker() {
      public int visit(Graphable element, GraphTraversal traversal) {
        element.setCount(getCount());
        return super.visit(element, traversal);
      }
    }; 
    DepthFirstTopologicalIterator iterator = createIterator();
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    assertTrue(walker.getCount() == nnodes);
   
    boolean flip = false;
   
    for (
      Iterator itr = builder().getGraph().getNodes().iterator();
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
   */
  public void test_1() {
    int nnodes = 100;
    GraphTestUtil.buildCircular(builder(), nnodes);
   
    CountingWalker walker = new CountingWalker();
    BreadthFirstTopologicalIterator iterator = createIterator();
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    ); 
    traversal.init();
    traversal.traverse();
   
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        assertTrue(!component.isVisited());
        return 0;
      }
    };
    builder().getGraph().visitNodes(visitor);
   
    assertTrue(walker.getCount() == 0);
  }
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
   */
  public void test_0() {
    int nnodes = 100;
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), nnodes);

    CountingWalker walker = new CountingWalker() {
      public int visit(Graphable element, GraphTraversal traversal) {
        super.visit(element, traversal);
        element.setCount(getCount()-1);
       
        //nodes should be visited in order
        assertTrue(element.getID() == getCount()-1);
        return(GraphTraversal.CONTINUE);
      }
    };
       
    NoBifurcationIterator iterator = createIterator();
    iterator.setSource(ends[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    //every node should have been visited
    assertTrue(walker.getCount() == builder().getGraph().getNodes().size());
  }
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
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
  public void test_1() {
    int nnodes = 100;
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), nnodes);
    final int suspend = 50;;
   
    CountingWalker walker = new CountingWalker() {
      private int m_mode = 0;
     
      public int visit(Graphable element, GraphTraversal traversal) {
        super.visit(element, traversal);
        if (m_mode == 0) {
          //check for stopping node
          if (element.getID() == suspend) {
            m_mode++;
            return(GraphTraversal.SUSPEND);
          }
        }
        else if (m_mode == 1) {
          //check first node after continue
          assertTrue(element.getID() == suspend + 1);
          m_mode++;
        }
        return(GraphTraversal.CONTINUE);
      }
    };
   
    NoBifurcationIterator iterator = createIterator();
    iterator.setSource(ends[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    traversal.traverse();
   
    //stopping node should be visited and nodes with greater id should not
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component.getID() <= suspend) assertTrue(component.isVisited());
        else assertTrue(!component.isVisited());
        return(0);
      }
    };
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == nnodes-suspend+1);
   
    traversal.traverse();
   
    //every node should now be visited
    visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        assertTrue(component.isVisited());  
        return(0);
      }
    };
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == nnodes);
  } 
View Full Code Here
TOP

Related Classes of org.geotools.graph.traverse.basic.CountingWalker

  • org.geotools.graph.traverse.standard.AStarIteratorTest
  • org.geotools.graph.traverse.standard.BreadthFirstIteratorTest
  • org.geotools.graph.traverse.standard.BreadthFirstTopologicalIteratorTest
  • org.geotools.graph.traverse.standard.DepthFirstIteratorTest
  • org.geotools.graph.traverse.standard.DepthFirstTopologicalIteratorTest
  • org.geotools.graph.traverse.standard.DijkstraIteratorTest
  • org.geotools.graph.traverse.standard.NoBifurcationIteratorTest
    • 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.