Package org.geotools.graph.traverse.basic

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

45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
  public void test_7() {
    final Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), 100);
   
    DummyGraphWalker walker = new DummyGraphWalker();
    DirectedDepthFirstIterator iterator = new DirectedDepthFirstIterator();
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
   
    iterator.setSource(ends[1]);
    traversal.traverse();
   
    //ensure only last node visited
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        if (component == ends[1]) assertTrue(component.isVisited());
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
        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;
   
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
    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;
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
84
    };
       
    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
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
    };
   
    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());  
View Full Code Here
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
    };
   
    NoBifurcationIterator iterator = createIterator();
    iterator.setSource(ends[0]);
   
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    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);
      }
    };
    builder().getGraph().visitNodes(visitor);
    assertTrue(walker.getCount() == nnodes-kill+1);
   
    //continue, no more nodes should be visited
    traversal.traverse();
  } 
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
   
    CountingWalker walker = new CountingWalker();
    NoBifurcationIterator 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() < bif) {
          assertTrue(component.isVisited()); 
View Full Code Here
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
    
     CountingWalker walker = new CountingWalker();
     NoBifurcationIterator iterator = createIterator();
     iterator.setSource(source);
    
     BasicGraphTraversal traversal = new BasicGraphTraversal(
       builder().getGraph(), walker, iterator
     );
     traversal.init();
     traversal.traverse();
    
     //ensure all nodes visisited
     visitor = new GraphVisitor() {
       public int visit(Graphable component) {
         assertTrue(component.isVisited());
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
       
        CountingWalker walker = new CountingWalker();
       
        final AStarIterator iterator = createIterator(ends[0],ends[ends.length-1]);
       
        BasicGraphTraversal traversal = new BasicGraphTraversal(
          builder().getGraph(), walker, iterator
        );
        traversal.init();
        traversal.traverse();
       
        GraphVisitor visitor = new GraphVisitor() {
          public int visit(Graphable component) {
          assertTrue(component.isVisited());
            if (component.getID() == 0) assertNull(iterator.getParent((Node) component));
View Full Code Here
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
        }
      };
     
      final AStarIterator iterator = createIterator(ends[0],ends[ends.length-1]);
     
      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());
          if (component.getID() == 0) assertNull(iterator.getParent((Node)component));
View Full Code Here
TOP

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

  • org.geotools.graph.GraphExamples
  • org.geotools.graph.path.AStarShortestPathFinder
  • org.geotools.graph.path.DijkstraShortestPathFinder
  • org.geotools.graph.path.WalkTest
  • org.geotools.graph.structure.Graphable
  • org.geotools.graph.structure.GraphVisitor
  • org.geotools.graph.traverse.standard.AStarIteratorTest
  • org.geotools.graph.traverse.standard.BreadthFirstIteratorTest
  • org.geotools.graph.traverse.standard.BreadthFirstTopologicalIteratorTest
  • org.geotools.graph.traverse.standard.DepthFirstIteratorTest
    • 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.