Package org.geotools.graph.structure

Examples of org.geotools.graph.structure.GraphVisitor

473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
    * <BR>
    * Expected: 1. All nodes visited.
    */
   public void test_6() {
     GraphTestUtil.buildCircular(builder(), 100);
     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();
     BreadthFirstIterator 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
49
50
51
52
53
54
55
56
57
58
59
    m_maxplen = maxplen;
  }
 
  public Path getPath(Node from, Node to) {
       final Node dst = to;
       GraphVisitor visitor = new GraphVisitor() {
         public int visit(Graphable component) {
         if (component.equals(dst)) return(END_PATH_AND_STOP);
         return(CONTINUE_PATH);
         }
       };
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
       return((Path)paths.get(0));
  }
 
  public List getPaths(Node from, Node to) {
    final Node dst = to;
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
      if (component.equals(dst)) return(END_PATH_AND_CONTINUE);
      return(CONTINUE_PATH);
    }
    };
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
    public List getNodesOfDegree(int n) {
      final int degree = n;

      return (
        queryNodes(
          new GraphVisitor() {
            public int visit(Graphable component) {
              if (((Node) component).getDegree() == degree)
                return (PASS_AND_CONTINUE);
              return (FAIL_QUERY);
            }
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
    private List getVisited(Collection components, boolean visited) {
      final boolean isVisited = visited;
      return (
        query(
          components,
          new GraphVisitor() {
            public int visit(Graphable component) {
              if (component.isVisited() == isVisited)
                return (PASS_AND_CONTINUE);
              return (FAIL_QUERY);
            }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
    //create queue
    m_queue = buildQueue(graph);
   
    //initialize nodes
    graph.visitNodes(
      new GraphVisitor() {
        public int visit(Graphable component) {
          DirectedNode node = (DirectedNode)component;
         
          node.setVisited(false);
          node.setCount(0);
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
    //create queue
    m_queue = buildQueue(graph);
   
    //initialize nodes
    graph.visitNodes(
      new GraphVisitor() {
        public int visit(Graphable component) {
          Node node = (Node)component;
         
          //reset counter to zero
          node.setCount(0);
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
    queue = new PriorityQueue(comparator);
    queue.init(graph.getNodes().size());
   
    //place nodes into priority queue
    graph.visitNodes(
      new GraphVisitor() {
        public int visit(Graphable component) {
          //create a dijkstra node with infinite cost
          DijkstraNode dn = new DijkstraNode((Node)component, Double.MAX_VALUE);
         
          //create the mapping
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
   * @see GraphTraversal#init()
   */
  public void init() {
    //initialize the nodes of the graph
    m_graph.visitNodes(
      new GraphVisitor() {
        public int visit(Graphable component) {
          component.setVisited(false);
          component.setCount(0);
          return(0);
        }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
  }
 
  public void init() {
    //initialize the nodes of the graph by setting counts to 0
    getGraph().visitNodes(
      new GraphVisitor() {
        public int visit(Graphable component) {
          component.setCount(0);
          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.