Package org.geotools.graph.structure

Examples of org.geotools.graph.structure.GraphVisitor

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
   
    iterator.setSource(ends[0]);
    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);
   
    //ensure nodes only visited once
    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);
      }
    };
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
   
    iterator.setSource(ends[0]);
    traversal.traverse();
   
    //kill node should be visited and nodes with greater id should not
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component.getID() <= kill) assertTrue(component.isVisited());
        else assertTrue(!component.isVisited());
        return(0);
      }
View Full Code Here
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
267
268
269
270
271
272
273
274
275
     int k = 4;
     Object[] obj = GraphTestUtil.buildPerfectBinaryTree(builder(), k);
     Node root = (Node)obj[0];
     final Map obj2node = (Map)obj[1];
    
     GraphVisitor initializer = new GraphVisitor() {
      public int visit(Graphable component) {
        component.setCount(-1);
        return 0;
      }
     };
    
     CountingWalker walker = new CountingWalker() {
      public int visit(Graphable element, GraphTraversal traversal) {
        element.setCount(getCount());
        return super.visit(element, traversal);
      }
     };
    
     DepthFirstIterator iterator = createIterator();
     BasicGraphTraversal traversal = new BasicGraphTraversal(
       builder().getGraph(), walker, iterator
     );
     traversal.init();
    
     iterator.setSource(root);
     traversal.traverse();
    
     GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        //ensure component visited
        assertTrue(component.isVisited());
       
        Node ln = (Node)obj2node.get(component.getObject().toString() + ".0");
View Full Code Here
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
       (rn.isVisited() && !ln.isVisited()) ||
       (!rn.isVisited() && ln.isVisited())
     );
     assertTrue(walker.getCount() == 2);
    
     GraphVisitor visitor = new GraphVisitor() {
       public int visit(Graphable component) {
         if (component != root && component != ln && component != rn) {
           assertTrue(!component.isVisited()); 
         }
         return(0);
       }
     };
     builder().getGraph().visitNodes(visitor);
    
     traversal.traverse();
    
     //ensure all nodes visited
     visitor = new GraphVisitor() {
       public int visit(Graphable component) {
         assertTrue(component.isVisited());
         return(0);
       }
     };
View Full Code Here
466
467
468
469
470
471
472
473
474
475
476
     //ensure that subnodes of first visited after root are not visited
     final String id = (ln.getCount() < rn.getCount()) ?
                   ln.getObject().toString() :
                   rn.getObject().toString();
    
     GraphVisitor visitor = new GraphVisitor() {
       public int visit(Graphable component) {
         String eid = component.getObject().toString();
         if (eid.length() <= id.length()) assertTrue(component.isVisited());
         else if (eid.startsWith(id)) assertTrue(!component.isVisited());
         else assertTrue(component.isVisited());
View Full Code Here
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
    * Expected: 1. All nodes visited.
    */
   public void test_6() {
     int nnodes = 100;
     GraphTestUtil.buildCircular(builder(), nnodes);
     GraphVisitor visitor = new GraphVisitor() {
        public int visit(Graphable component) {
          if (component.getID() == 50) return(Graph.PASS_AND_CONTINUE);
          return(Graph.FAIL_QUERY); 
        }
     };
     Node source = (Node)builder().getGraph().queryNodes(visitor).get(0);
    
     CountingWalker walker = new CountingWalker();
     DepthFirstIterator iterator = createIterator();
    
     BasicGraphTraversal traversal = new BasicGraphTraversal(
       builder().getGraph(), walker, iterator
     );
     traversal.init();
    
     iterator.setSource(source);
     traversal.traverse();
    
     //ensure all nodes visisited
     visitor = new GraphVisitor() {
       public int visit(Graphable component) {
         assertTrue(component.isVisited());
         return(0);
       }
     };
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
  public void test_getEdges() {
    assertTrue(m_graph.getEdges() == m_edges);   
  }
 
  public void test_queryNodes() {
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component == m_nodes.get(1) || component == m_nodes.get(2))
          return(BasicGraph.PASS_AND_CONTINUE);
        return(BasicGraph.FAIL_QUERY);
      }
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
    assertTrue(result.get(0) == m_nodes.get(1));
    assertTrue(result.get(1) == m_nodes.get(2));
  }

  public void test_queryEdges() {
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component == m_edges.get(1) || component == m_edges.get(2))
          return(BasicGraph.PASS_AND_CONTINUE);
        return(BasicGraph.FAIL_QUERY);
      }
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
    assertTrue(result.get(1) == m_edges.get(2));
  }
 
  public void test_visitNodes() {
    final HashSet visited = new HashSet();
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        visited.add(component);
        return(0);
      }
    };
View Full Code Here
127
128
129
130
131
132
133
134
135
136
137
    }
  }
 
  public void test_visitEdges() {
    final HashSet visited = new HashSet();
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        visited.add(component);
        return(0);
      }
    };
View Full Code Here
TOP

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

  • org.geotools.graph.GraphTestUtil
  • org.geotools.graph.io.standard.BasicGraphSerializerTest
  • org.geotools.graph.io.standard.DirectedGraphSerializerTest
  • org.geotools.graph.io.standard.OptDirectedGraphSerializerTest
  • org.geotools.graph.linegraph.DirectedLineGraphGeneratorTest
  • org.geotools.graph.linegraph.LineGraphGeneratorTest
  • org.geotools.graph.linegraph.OptDirectedLineGraphGeneratorTest
  • org.geotools.graph.linegraph.OptLineGraphGeneratorTest
  • org.geotools.graph.path.ExhaustivePathFinder
  • org.geotools.graph.structure.basic.BasicGraph
    • 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.