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

Package org.geotools.graph.traverse.basic

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

org.geotools.graph.traverse.basic.CountingWalker
An implementation of GraphWalker that counts the number of components visited. As each component is visited, the walker sets the count of the component to the value of its counter. @see Graphable#setCount(int) @author Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net @source $URL$

     */
    public void test_0() {
        final int nnodes = 100;
        Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), nnodes);
        
        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));
            else assertTrue(component.getID() == iterator.getParent((Node)component).getID() + 1);
            return 0;
          }
        };
        builder().getGraph().visitNodes(visitor);
        
        assertTrue(walker.getCount() == nnodes);
      }

View Full Code Here

    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 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));
          else assertTrue(
            iterator.getParent((Node)component).getID() == component.getID() - 1
          );
              
          return 0;
        }
      };
      builder().getGraph().visitNodes(visitor);
      assertTrue(walker.getCount() == nnodes);
    }

View Full Code Here

    GraphTestUtil.buildNoBifurcations(builder(), nnodes);  
    
    //note: traversal uses count and we are changing the count value here. 
    // but it shouldn't matter because at the time of visitation, the traversal
    // no longer needs the counter value.
    CountingWalker walker = new CountingWalker() {
      public int visit(Graphable element, GraphTraversal traversal) {
        element.setCount(getCount());
        return super.visit(element, traversal);
      }
    };
    
    BreadthFirstTopologicalIterator 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(); itr.hasNext();
    ) {

View Full Code Here

   */
  public void test_1() {
    int k = 4;
    GraphTestUtil.buildPerfectBinaryTree(builder(), k);
    
    CountingWalker walker = new CountingWalker() {
      public int visit(Graphable element, GraphTraversal traversal) {
        element.setCount(getCount());
        return super.visit(element, traversal);
      }
    };
    
    BreadthFirstTopologicalIterator iterator = createIterator();
    
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator   
    );
    traversal.init();
    traversal.traverse();
    
    //ensure that each node in lower level visited before node in higher level
    GraphVisitor visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        String id = component.getObject().toString();
        
        for(
          Iterator itr = builder().getGraph().getNodes().iterator(); 
          itr.hasNext();
        ) {
          Node other = (Node)itr.next();
          if (other.getObject().toString().length() < id.length()) {
            assertTrue(other.getCount() > component.getCount());
          }  
        } 
        return 0;
      }
    };
    builder().getGraph().visitNodes(visitor);
    
    assertTrue(walker.getCount() == Math.pow(2,k+1)-1);
  }

View Full Code Here

   */
  public void test_2() {
    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

   */
  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);
      }
    };
        
    DepthFirstIterator iterator = createIterator();
    
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    
    iterator.setSource(ends[0]);
    traversal.traverse();
    
    //every node should have been visited
    assertTrue(walker.getCount() == builder().getGraph().getNodes().size());
    
    //ensure nodes visited only once
    assertTrue(walker.getCount() == nnodes);
    
  }

View Full Code Here

  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);
      }
    };
    
    DepthFirstIterator iterator = createIterator();
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    
    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);
      }
    };
    builder().getGraph().visitNodes(visitor);
    
    //ensure nodes only visited once
    assertTrue(walker.getCount() == nnodes);
    
  }

View Full Code Here

  public void test_2() {
    int nnodes = 100;
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), nnodes);
    final int kill = 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() == kill) {
            m_mode++; 
            return(GraphTraversal.KILL_BRANCH);
          }
        }
        else if (m_mode == 1) {
          //should never get here
          assertTrue(false);
        }
        return(GraphTraversal.CONTINUE);
      }
    };
    
    DepthFirstIterator iterator = createIterator();
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator
    );
    traversal.init();
    
    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);
      }
    };
    builder().getGraph().visitNodes(visitor);
    
    //ensure nodes only visited once
    assertTrue(walker.getCount() == nnodes-kill+1);
    
    //continue, no more nodes should be visited
    traversal.traverse();
  }

View Full Code Here

        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");
        Node rn = (Node)obj2node.get(component.getObject().toString() + ".1");
        
        if (ln != null) {
          Node n1 = ln;
          Node n2 = rn;
          if (ln.getCount() > rn.getCount()) {
            n1 = rn;
            n2 = ln;  
          }  
          
          FIFOQueue queue = new FIFOQueue(256);
          queue.enq(n1);
          
          //ensure all subnodes of n1 visited before n2
          while(!queue.isEmpty()) {
            Node n = (Node)queue.deq();
            
            ln = (Node)obj2node.get(n.getObject().toString() + ".0");
            rn = (Node)obj2node.get(n.getObject().toString() + ".1");
            
            if (ln == null) continue;
            
            assertTrue(ln.getCount() < n2.getCount());
            assertTrue(rn.getCount() < n2.getCount());
            
            queue.enq(ln);
            queue.enq(rn);    
          }
        } 
        return 0;
      }
     };
     
     builder().getGraph().visitNodes(visitor);
     
     //ensure nodes only visited once
     assertTrue(walker.getCount() == (int)Math.pow(2,k+1)-1);
   }

View Full Code Here

     final Node root = (Node)obj[0];
     final Map obj2node = (Map)obj[1];
     final Node ln = (Node)obj2node.get(root.getObject().toString() + ".0");
     final Node rn = (Node)obj2node.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 != root) {
             //check which child of root was first visited
             m_mode++;
             return(GraphTraversal.SUSPEND);  
           }   
         }  
         else if (m_mode == 1) {
           String eid = element.getObject().toString();
           if (ln.isVisited()) {
             assertTrue(
               eid.equals(ln.getObject().toString()+".0")  
            || eid.equals(ln.getObject().toString()+".1")
             );  
           }
           else {
             assertTrue(
               eid.equals(rn.getObject().toString()+".0")  
            || eid.equals(rn.getObject().toString()+".1")
             );
           }  
           m_mode++;  
         }
         
         return(GraphTraversal.CONTINUE);
       }
     };
          
     DepthFirstIterator iterator = createIterator();
     BasicGraphTraversal traversal = new BasicGraphTraversal(
       builder().getGraph(), walker, iterator
     );
     traversal.init();
     
     iterator.setSource(root);
     traversal.traverse();
     
     //ensure that only root and one of children is visited
     assertTrue(root.isVisited());
     assertTrue(
       (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);
       }
     };
     
     builder().getGraph().visitNodes(visitor);
     
     assertTrue(walker.getCount() == (int)Math.pow(2,k+1)-1);
   }

View Full Code Here

0 1 2 3

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

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.