Examples of org.geotools.graph.structure.opt.OptNode

Package org.geotools.graph.structure.opt

Examples of org.geotools.graph.structure.opt.OptNode

org.geotools.graph.structure.opt.OptNode
Optimized implementation of Node. The following optimizations reduce space and improve performance.
- Edge adjacency list stored as array of predetermined size.
- Removing support for removing edges from the nodes ajdacency list.
- The related component iterator iterates over the underlying edge array of the node instread of a newly created collection.
Using an optimized node requires that the degree of the node be known before the node is built. @author Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net @see Node @source $URL$

    assertTrue(m_builder.getNodes().size() == 1);
    assertTrue(m_builder.getNodes().contains(n1));
  }
  
  public void test_addEdge() {
    OptNode n1 = (OptNode)m_builder.buildNode();
    n1.setDegree(1);
    
    OptNode n2 = (OptNode)m_builder.buildNode();
    n2.setDegree(1);
    
    Edge e = m_builder.buildEdge(n1, n2);
    
    m_builder.addNode(n1);
    m_builder.addNode(n2);
    
    m_builder.addEdge(e);
    
    assertTrue(m_builder.getEdges().size() == 1);
    assertTrue(m_builder.getEdges().contains(e));
    
    assertTrue(n1.getEdges().contains(e));
    assertTrue(n2.getEdges().contains(e));
  }

View Full Code Here

    assertTrue(n1.getEdges().contains(e));
    assertTrue(n2.getEdges().contains(e));
  }
  
  public void test_removeNode() {
    OptNode n1 = (OptNode)m_builder.buildNode();
    n1.setDegree(0);
    
    m_builder.addNode(n1);
    
    assertTrue(m_builder.getNodes().contains(n1));

View Full Code Here

    m_builder.removeNode(n1);
    assertTrue(m_builder.getNodes().isEmpty());
  }
  
  public void test_removeNodes() {
    OptNode n1 = (OptNode)m_builder.buildNode();
    n1.setDegree(0);
    
    OptNode n2 = (OptNode)m_builder.buildNode();
    n2.setDegree(0);
    
    m_builder.addNode(n1);
    m_builder.addNode(n2);
    
    assertTrue(m_builder.getNodes().size() == 2);

View Full Code Here

    m_builder.removeNodes(toRemove);
    assertTrue(m_builder.getNodes().isEmpty());
  }
  
  public void test_removeEdge() {
    OptNode n1 = (OptNode)m_builder.buildNode();
    n1.setDegree(1);
    
    OptNode n2 = (OptNode)m_builder.buildNode();
    n2.setDegree(1);
    
    Edge e = m_builder.buildEdge(n1, n2);
    
    m_builder.addNode(n1);
    m_builder.addNode(n2);
    m_builder.addEdge(e);
    
    assertTrue(n1.getEdges().contains(e));
    assertTrue(n2.getEdges().contains(e));
    
    try {
      m_builder.removeEdge(e);
      assertTrue(false);
    }

View Full Code Here

      assertTrue(true);    
    }
  }
  
  public void test_removeEdges() {
    OptNode n1 = (OptNode)m_builder.buildNode();
    n1.setDegree(1);
    OptNode n2 = (OptNode)m_builder.buildNode();
    n2.setDegree(1);
    OptNode n3 = (OptNode)m_builder.buildNode();
    n3.setDegree(1);
    OptNode n4 = (OptNode)m_builder.buildNode();
    n4.setDegree(1);
    
    Edge e1 = m_builder.buildEdge(n1, n2);
    Edge e2 = m_builder.buildEdge(n3, n4);
    
    m_builder.addNode(n1);

View Full Code Here

   * 
   * @see GraphBuilder#buildNode()
   * @see OptNode
   */
  public Node buildNode() {
    return(new OptNode());
  }

View Full Code Here

      generateEdge(line);
    }
  }
  
  protected Edge generateEdge(LineSegment line) {
    OptNode n1 = (OptNode)m_coord2count.get(line.p0);
    OptNode n2 = (OptNode)m_coord2count.get(line.p1);
    
    OptEdge edge = (OptEdge)m_builder.buildEdge(n1,n2);
    m_builder.addEdge(edge);
    
    return(edge);

View Full Code Here

  ) {
    //use maps for id since optimized graphable doesn't use id's
    HashMap node2id = new HashMap();
    HashMap edge2id = new HashMap();
    
    OptNode n1 = (OptNode)builder.buildNode();
    n1.setDegree(1);
     
    builder.addNode(n1);
    node2id.put(n1, new Integer(0));
    
    OptNode n2 = null;
    Edge e = null;
    OptNode first = n1;
    
    for (int i = 1; i < nnodes; i++) {
      n2 = (OptNode)builder.buildNode();
      if (i < nnodes-1) n2.setDegree(2);
      else n2.setDegree(1);

View Full Code Here

  }
  
  public static Object[] buildPerfectBinaryTree(
    OptGraphBuilder builder, int levels
  ) {
    OptNode root = (OptNode)builder.buildNode();
    root.setDegree(2);
    builder.addNode(root);
    
    FIFOQueue queue = new FIFOQueue((int)Math.pow(2, levels+1));
    queue.enq(root);
    
    //build a complete binary tree 
    // number of nodes = 2^(n+1) - 1
    int level = 0;
    while (level < levels) {   
      int nnodes = (int)Math.pow(2, level);
      for (int i = 0; i < nnodes; i++) {
        Node n = (Node)queue.deq();  
        
        OptNode ln = (OptNode) builder.buildNode();
        if (level < levels-1) ln.setDegree(3);
        else ln.setDegree(1);
        
        OptNode rn = (OptNode) builder.buildNode();
        if (level < levels-1) rn.setDegree(3);
        else rn.setDegree(1);
        
        Edge le = builder.buildEdge(n, ln);
        Edge re = builder.buildEdge(n, rn);
        
        builder.addNode(ln);

View Full Code Here

TOP

Related Classes of org.geotools.graph.structure.opt.OptNode

org.geotools.graph.build.line.OptLineGraphGenerator

org.geotools.graph.build.opt.OptGraphBuilder

org.geotools.graph.build.opt.OptGraphBuilderTest

org.geotools.graph.GraphTestUtil

org.geotools.graph.structure.Edge

java.util.ArrayList

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.