Examples of DirectedEdge

com.vividsolutions.jts.geomgraph.DirectedEdge
@version 1.7
com.vividsolutions.jts.planargraph.DirectedEdge
Represents a directed edge in a {@link PlanarGraph}. A DirectedEdge may or may not have a reference to a parent {@link Edge} (some applications ofplanar graphs may not require explicit Edge objects to be created). Usually a client using a PlanarGraph will subclass DirectedEdge to add its own application-specific data and methods. @version 1.7
de.timefinder.algo.graph.DirectedEdge
@author Peter Karich, peat_hal ‘at’ users ‘dot’ sourceforge ‘dot’ net
edu.uci.ics.jung.graph.DirectedEdge
graph.model.directed.DirectedEdge
org.geotools.geometry.iso.topograph2D.DirectedEdge
Represents a directed edge in a {@link PlanarGraph}. A DirectedEdge may or may not have a reference to a parent {@link Edge} (some applications ofplanar graphs may not require explicit Edge objects to be created). Usually a client using a PlanarGraph will subclass DirectedEdge to add its own application-specific data and methods. @source $URL$
org.geotools.graph.structure.DirectedEdge
Represents an edge in a directed graph. A directed edge catagorizes its nodes as originating (in node), and terminating (out node). The edge is an out edge of its in node and an in edge to its out node. @see DirectedGraph @author Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net @source $URL$

Examples of org.geotools.graph.structure.DirectedEdge

   * 
   * @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

Examples of org.geotools.graph.structure.DirectedEdge

   */
  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

Examples of org.geotools.graph.structure.DirectedEdge

   */
  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

Examples of org.geotools.graph.structure.DirectedEdge

   * @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

Examples of org.geotools.graph.structure.DirectedEdge

   * @see DirectedNode#getOutEdges(DirectedNode)
   */
  public List getOutEdges(DirectedNode other) {
    ArrayList edges = new ArrayList();
    for (int i = 0; i < m_out.size(); i++) {
      DirectedEdge edge = (DirectedEdge)m_out.get(i);
      if (edge.getOutNode().equals(other)) edges.add(edge);
    }
    return(edges);
  }

View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

   * @see org.geotools.graph.structure.Graphable#getRelated() 
   */
  public Iterator getRelated() {
    ArrayList related = new ArrayList(m_out.size()+m_in.size());
    for (int i = 0; i < m_in.size(); i++) {
      DirectedEdge e = (DirectedEdge)m_in.get(i);
      related.add(e.getInNode());
    }
    
    for (int i = 0; i < m_out.size(); i++) {
      DirectedEdge e = (DirectedEdge)m_out.get(i);
      related.add(e.getOutNode());
    }
    return(related.iterator());
  }

View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

   * @see org.geotools.graph.structure.DirectedGraphable#getInRelated()
   */
  public Iterator getInRelated() {
    ArrayList related = new ArrayList(m_in.size());
    for (int i = 0; i < m_in.size(); i++) {
      DirectedEdge e = (DirectedEdge)m_in.get(i);
      related.add(e.getInNode());
    }
  
    return(related.iterator());
  }

View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

   * @see org.geotools.graph.structure.DirectedGraphable#getOutRelated()
   */
  public Iterator getOutRelated() {
    ArrayList related = new ArrayList(m_out.size());
    for (int i = 0; i < m_out.size(); i++) {
      DirectedEdge e = (DirectedEdge)m_out.get(i);
      related.add(e.getOutNode());
    }
    return(related.iterator());
  }

View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

   * @see org.geotools.graph.structure.DirectedGraphable#getInRelated()
   */
  public Iterator getInRelated() {
    ArrayList in = new ArrayList();
    for (Iterator itr = m_in.getInEdges().iterator(); itr.hasNext();) {
      DirectedEdge de = (DirectedEdge)itr.next();
      //this check has to be because the edge could be a loop in which case
      // it is in related to itself
      if (!de.equals(this)) in.add(de);  
    }
    return(in.iterator());  
  }

View Full Code Here

Examples of org.geotools.graph.structure.DirectedEdge

   * @see org.geotools.graph.structure.DirectedGraphable#getOutRelated() 
   */
  public Iterator getOutRelated() {
     ArrayList out = new ArrayList();
    for (Iterator itr = m_out.getOutEdges().iterator(); itr.hasNext();) {
      DirectedEdge de = (DirectedEdge)itr.next();
      //this check has to be because the edge could be a loop in which case
      // it is in related to itself
      if (!de.equals(this)) out.add(de);  
    }
    return(out.iterator());    
  }

View Full Code Here

0 1 2 3 4

TOP

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.