Package org.geotools.graph.structure

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
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
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
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
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
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
64
65
66
67
68
69
70
71
72
73
   *
   * @see DirectedEdge
   * @see GraphBuilder#addEdge(Edge)
   */
  public void addEdge(Edge edge) {
    DirectedEdge de = (DirectedEdge)edge;
    de.getInNode().addOut(de);
    de.getOutNode().addIn(de);
    getEdges().add(de);
  }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
   */
  public Edge getInEdge(DirectedNode other) {
    //must explictley check that the edge has node other, and one node this,
    // just checking other is not good enough because of loops
    for (int i = 0; i < m_in.size(); i++) {
      DirectedEdge edge = (DirectedEdge)m_in.get(i);
      if (edge.getInNode().equals(other) && edge.getOutNode().equals(this))
        return(edge);
    }
    return(null);
  }
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
   */
  public Edge getOutEdge(DirectedNode other) {
    //must explictley check that the edge has node other, and one node this,
    // just checking other is not good enough because of loops
    for (int i = 0; i < m_out.size(); i++) {
      DirectedEdge edge = (DirectedEdge)m_out.get(i);
      if (edge.getOutNode().equals(other) && edge.getInNode().equals(this))
        return(edge);
    }
    return(null);
  }
View Full Code Here
204
205
206
207
208
209
210
211
212
213
   * @see DirectedNode#getInEdges(DirectedNode)
   */
  public List getInEdges(DirectedNode other) {
    ArrayList edges = new ArrayList();
    for (int i = 0; i < m_in.size(); i++) {
      DirectedEdge edge = (DirectedEdge)m_in.get(i);
      if (edge.getInNode().equals(other)) edges.add(edge);
    }
    return(edges);
  }
View Full Code Here
TOP

Related Classes of org.geotools.graph.structure.DirectedEdge

  • org.geotools.graph.build.basic.BasicDirectedGraphBuilder
  • org.geotools.graph.build.basic.BasicDirectedGraphBuilderTest
  • org.geotools.graph.build.opt.OptDirectedGraphBuilderTest
  • org.geotools.graph.io.standard.DirectedGraphSerializerTest
  • org.geotools.graph.linegraph.DirectedLineGraphGeneratorTest
  • org.geotools.graph.structure.basic.BasicDirectedEdge
  • org.geotools.graph.structure.basic.BasicDirectedNode
    • 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.