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

Package org.geotools.graph.traverse.basic

Class org.geotools.graph.traverse.basic.BasicGraphTraversal

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

org.geotools.graph.traverse.basic.BasicGraphTraversal.traverse()

Upon each iteration of the traversal, a component is returned from the iterator and passed to the visitor. The traversal interprets the return codes from the walker and performs the following actions.

Code	Action Performed
CONTINUE	The traversal instructs the iterator to continue and starts the next stage of iteration.
SUSPEND	The traversal instructs the iterator to continue but does not start the next stage of iteration, returning from traverse().
KILL_BRANCH	The traversal instructs the iterator to kill the current branch and starts the next stage of iteration.
STOP	The traversal does not instruct the iterator to continue and does not start the next of iteration, returning from traverse()

@see GraphTraversal#traverse()

    };
    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());

View Full Code Here

    
    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());

View Full Code Here

    };
    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

    
    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();

View Full Code Here

    
    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());

View Full Code Here

      }
    };
    builder().getGraph().visitNodes(visitor);
    
    //resume
    traversal.traverse();
    
    visitor = new GraphVisitor() {
      public int visit(Graphable component) {
        assertTrue(component.isVisited());
        return(0);

View Full Code Here

    
    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());

View Full Code Here

    
    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) {

View Full Code Here

    
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator  
    );
    traversal.init();
    traversal.traverse();
    
    assertTrue(walk.size() == builder().getGraph().getNodes().size());
    assertTrue(walk.isValid() && !walk.isClosed());
    
    //create a new edges in the graph making the graph a cycle

View Full Code Here

    
    BasicGraphTraversal traversal = new BasicGraphTraversal(
      builder().getGraph(), walker, iterator  
    );
    traversal.init();
    traversal.traverse();
    
    assertTrue(walk.getEdges() != null);
    assertTrue(walk.isValid());
  }

View Full Code Here

0 1 2 3 4 5

TOP

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.