Package org.geotools.graph.structure.opt

Examples of org.geotools.graph.structure.opt.OptDirectedNode$RelatedIterator

63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
    assertTrue(de.getInNode() == n1);
    assertTrue(de.getOutNode() == n2);
  }
 
  public void test_addEdge() {
    OptDirectedNode n1 = (OptDirectedNode)m_builder.buildNode();
    n1.setInDegree(0);
    n1.setOutDegree(1);

    OptDirectedNode n2 = (OptDirectedNode)m_builder.buildNode();
    n2.setInDegree(1);
    n2.setOutDegree(0);
   
    DirectedEdge e = (DirectedEdge)m_builder.buildEdge(n1,n2);
   
    m_builder.addEdge(e);
   
    assertTrue(m_builder.getEdges().contains(e));
    assertTrue(n1.getOutEdges().contains(e));
    assertTrue(n2.getInEdges().contains(e));
  }
View Full Code Here
43
44
45
46
47
48
49
   *
   * @see GraphBuilder#buildNode()
   * @see OptDirectedNode
   */
  public Node buildNode() {
    return(new OptDirectedNode());
  }
View Full Code Here
168
169
170
171
172
173
174
175
176
177
178
179
      entry.setValue(node);
    }
  }
 
  protected Edge generateEdge(LineSegment line) {
    OptDirectedNode n1 = (OptDirectedNode)m_in2count.get(line.p0);
    OptDirectedNode n2 = (OptDirectedNode)m_out2count.get(line.p1);
   
    Edge edge = getGraphBuilder().buildEdge(n1,n2);
    getGraphBuilder().addEdge(edge);
   
    return(edge); 
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
  ) {
    //use maps for id since optimized graphable doesn't use id's
    HashMap node2id = new HashMap();
    HashMap edge2id = new HashMap();
   
    OptDirectedNode n1 = (OptDirectedNode)builder.buildNode();
    n1.setInDegree(0);
    n1.setOutDegree(1);
    
    builder.addNode(n1);
    node2id.put(n1, new Integer(0));
   
    OptDirectedNode n2 = null;
    Edge e = null;
    OptDirectedNode first = n1;
   
    for (int i = 1; i < nnodes; i++) {
      n2 = (OptDirectedNode)builder.buildNode();
      if (i < nnodes-1) {
        n2.setInDegree(1);
View Full Code Here
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
  }
 
  public static Object[] buildPerfectBinaryTree(
    OptDirectedGraphBuilder builder, int levels
  ) {
    OptDirectedNode root = (OptDirectedNode)builder.buildNode();
    root.setInDegree(0);
    root.setOutDegree(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(); 
       
        OptDirectedNode ln = (OptDirectedNode) builder.buildNode();
        if (level < levels-1) {
          ln.setInDegree(1);
          ln.setOutDegree(2);
        }
        else {
          ln.setInDegree(1);
          ln.setOutDegree(0);
        }
       
        OptDirectedNode rn = (OptDirectedNode) builder.buildNode();
        if (level < levels-1) {
          rn.setInDegree(1);
          rn.setOutDegree(2);
        }
        else {
          rn.setInDegree(1);
          rn.setOutDegree(0);
        }
       
        Edge le = builder.buildEdge(n, ln);
        Edge re = builder.buildEdge(n, rn);
       
View Full Code Here
TOP

Related Classes of org.geotools.graph.structure.opt.OptDirectedNode$RelatedIterator

  • org.geotools.graph.build.line.OptDirectedLineGraphGenerator
  • org.geotools.graph.build.opt.OptDirectedGraphBuilder
  • org.geotools.graph.build.opt.OptDirectedGraphBuilderTest
  • org.geotools.graph.GraphTestUtil
  • org.geotools.graph.structure.Edge
  • java.util.List
  • java.util.ArrayList
    • 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.