Examples of org.geotools.graph.traverse.standard.NoBifurcationIterator

Package org.geotools.graph.traverse.standard

Examples of org.geotools.graph.traverse.standard.NoBifurcationIterator

org.geotools.graph.traverse.standard.NoBifurcationIterator
Iterates over the nodes of a graph starting from a specified node, stopping at a bifurcation. A bifurcation is defined as a node of degree > 2. The following figures illustrate examples of the iterator.

@author Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net @source $URL$

  
  public void test_isClosed() {
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), 10);
    final Walk walk = new Walk();
    
    NoBifurcationIterator iterator = new NoBifurcationIterator();
    iterator.setSource(ends[0]);
    
    GraphWalker walker = new GraphWalker() {
      public int visit(Graphable element, GraphTraversal traversal) {
        walk.add(element);
        return(GraphTraversal.CONTINUE);

View Full Code Here

  
  public void test_getEdges() {
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), 10);
    final Walk walk = new Walk();
    
    NoBifurcationIterator iterator = new NoBifurcationIterator();
    iterator.setSource(ends[0]);
    
    GraphWalker walker = new GraphWalker() {
      public int visit(Graphable element, GraphTraversal traversal) {
        walk.add(element);
        return(GraphTraversal.CONTINUE);

View Full Code Here

  
  public void test_truncate_0() {
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), 10);
    final Walk walk = new Walk();
    
    NoBifurcationIterator iterator = new NoBifurcationIterator();
    iterator.setSource(ends[0]);
    
    GraphWalker walker = new GraphWalker() {
      public int visit(Graphable element, GraphTraversal traversal) {
        walk.add(element);
        return(GraphTraversal.CONTINUE);

View Full Code Here

  
  public void test_truncate_1() {
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), 10);
    final Walk walk = new Walk();
    
    NoBifurcationIterator iterator = new NoBifurcationIterator();
    iterator.setSource(ends[0]);
    
    GraphWalker walker = new GraphWalker() {
      int count = 0;
      public int visit(Graphable element, GraphTraversal traversal) {
        walk.add(element);

View Full Code Here

  
  public void test_truncate_2() {
    Node[] ends = GraphTestUtil.buildNoBifurcations(builder(), 11);
    final Walk walk = new Walk();
    
    NoBifurcationIterator iterator = new NoBifurcationIterator();
    iterator.setSource(ends[0]);
    
    GraphWalker walker = new GraphWalker() {
      int count = 0;
      public int visit(Graphable element, GraphTraversal traversal) {
        walk.add(element);

View Full Code Here

          m_sets.add(m_nodes);
          m_nodes = new ArrayList();
        }
      };
      m_traversal.setWalker(m_walker);
      m_traversal.setIterator(new NoBifurcationIterator());
      
      //clear current node list
      m_nodes = new ArrayList();
            
      Node source = null;

View Full Code Here

TOP

Related Classes of org.geotools.graph.traverse.standard.NoBifurcationIterator

org.geotools.graph.path.WalkTest

org.geotools.graph.util.graph.GraphFuser

java.util.Iterator

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.