Examples of DirectedEdge

Examples of org.geotools.geometry.iso.topograph2D.DirectedEdge

116
117
118
119
120
121
122
123
124
125
    }
  }

  private void collectLines(int opCode) {
    for (Iterator it = op.getGraph().getEdgeEnds().iterator(); it.hasNext();) {
      DirectedEdge de = (DirectedEdge) it.next();
      collectLineEdge(de, opCode, lineEdgesList);
      collectBoundaryTouchEdge(de, opCode, lineEdgesList);
    }
  }
View Full Code Here

Examples of org.geotools.geometry.iso.topograph2D.DirectedEdge

104
105
106
107
108
109
110
111
112
113
114
115
116
117
   * for all DirectedEdges in result, form them into MaximalEdgeRings
   */
  private List buildMaximalEdgeRings(Collection dirEdges) {
    List maxEdgeRings = new ArrayList();
    for (Iterator it = dirEdges.iterator(); it.hasNext();) {
      DirectedEdge de = (DirectedEdge) it.next();
      if (de.isInResult() && de.getLabel().isArea()) {
        // if this edge has not yet been processed
        if (de.getEdgeRing() == null) {
          MaximalEdgeRing er = new MaximalEdgeRing(de,
              crs, cga);
          maxEdgeRings.add(er);
          er.setInResult();
          // System.out.println("max node degree = " +
View Full Code Here

Examples of org.geotools.geometry.iso.topograph2D.DirectedEdge

69
70
71
72
73
74
75
76
77
78
79
80
  /**
   * For all nodes in this EdgeRing, link the DirectedEdges at the node to
   * form minimalEdgeRings
   */
  public void linkDirectedEdgesForMinimalEdgeRings() {
    DirectedEdge de = startDe;
    do {
      Node node = de.getNode();
      ((DirectedEdgeStar) node.getEdges()).linkMinimalDirectedEdges(this);
      de = de.getNext();
    } while (de != startDe);
  }
View Full Code Here

Examples of org.geotools.geometry.iso.topograph2D.DirectedEdge

79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
    } while (de != startDe);
  }

  public List buildMinimalRings() {
    List minEdgeRings = new ArrayList();
    DirectedEdge de = startDe;
    do {
      if (de.getMinEdgeRing() == null) {
        EdgeRing minEr = new MinimalEdgeRing(de,
            super.crs, cga);
        minEdgeRings.add(minEr);
      }
      de = de.getNext();
    } while (de != startDe);
    return minEdgeRings;
  }
View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

50
51
52
53
54
55
56
57
58
59
60
 
  public void test_buildEdge() {
    Node n1 = m_builder.buildNode();
    Node n2 = m_builder.buildNode();
   
    DirectedEdge de = (DirectedEdge)m_builder.buildEdge(n1,n2);
   
    assertTrue(de != null);
    assertTrue(de.getInNode() == n1);
    assertTrue(de.getOutNode() == n2);
  }
View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

61
62
63
64
65
66
67
68
69
70
71
 
  public void test_addEdge_0() {
    DirectedNode n1 = (DirectedNode)m_builder.buildNode();
    DirectedNode n2 = (DirectedNode)m_builder.buildNode();
   
    DirectedEdge e = (DirectedEdge)m_builder.buildEdge(n1,n2);
   
    m_builder.addEdge(e);
   
    assertTrue(m_builder.getEdges().contains(e));
    assertTrue(n1.getOutEdges().contains(e));
View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

73
74
75
76
77
78
79
80
81
82
83
  }
 
  public void test_addEdge_1() {
    //add a loop edge, in degree == 1, out degree = 1, degree == 2
    DirectedNode n1 = (DirectedNode)m_builder.buildNode();
    DirectedEdge e = (DirectedEdge)m_builder.buildEdge(n1,n1);
   
    m_builder.addNode(n1);
    m_builder.addEdge(e);
   
    assertTrue(n1.getInEdges().size() == 1);
View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
      assertTrue(before.getEdges().size() == after.getEdges().size());
     
      //ensure same graph structure
      GraphVisitor visitor = new GraphVisitor() {
        public int visit(Graphable component) {
          DirectedEdge e = (DirectedEdge)component;
         
          assertTrue(e.getInNode().getID() == e.getID());
          assertTrue(e.getOutNode().getID() == e.getID()+1);
         
          return(0);
        }
      };
      after.visitEdges(visitor);
     
      visitor = new GraphVisitor() {
        public int visit(Graphable component) {
          DirectedNode n = (DirectedNode)component;
         
          if (n.getDegree() == 1) {
            assertTrue(n.getID() == 0 || n.getID() == nnodes-1); 
          }
          else {
            assertTrue(n.getDegree() == 2);
           
            Edge in = (Edge)n.getInEdges().get(0);
            Edge out = (Edge)n.getOutEdges().get(0);
           
            assertTrue(
              (in.getID() == n.getID()-1 && out.getID() == n.getID())
            );
           
          }
         
          return(0);
        }
      };
      after.visitNodes(visitor);
     
    }
    catch(Exception e) {
      e.printStackTrace();
      assertTrue(false); 
    }
  } 
View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

54
55
56
57
58
59
60
61
62
63
64
65
 
  public void test_buildEdge() {
    Node n1 = m_builder.buildNode();
    Node n2 = m_builder.buildNode();
   
    DirectedEdge de = (DirectedEdge)m_builder.buildEdge(n1,n2);
   
    assertTrue(de != null);
    assertTrue(de instanceof OptDirectedEdge);
    assertTrue(de.getInNode() == n1);
    assertTrue(de.getOutNode() == n2);
  }
View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

71
72
73
74
75
76
77
78
79
80
81
    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));
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.