Uses of Class
com.vividsolutions.jts.planargraph.DirectedEdge

Packages that use DirectedEdge
com.vividsolutions.jts.operation.linemerge Classes to perform line merging. 
com.vividsolutions.jts.planargraph Contains classes to implement a planar graph data structure. 
 

Uses of DirectedEdge in com.vividsolutions.jts.operation.linemerge
 

Subclasses of DirectedEdge in com.vividsolutions.jts.operation.linemerge
 class LineMergeDirectedEdge
          A DirectedEdge of a LineMergeGraph.
 

Uses of DirectedEdge in com.vividsolutions.jts.planargraph
 

Fields in com.vividsolutions.jts.planargraph declared as DirectedEdge
protected  DirectedEdge[] Edge.dirEdge
          The two DirectedEdges associated with this Edge.
protected  DirectedEdge DirectedEdge.sym
           
 

Methods in com.vividsolutions.jts.planargraph that return DirectedEdge
 DirectedEdge Edge.getDirEdge(int i)
          Returns one of the DirectedEdges associated with this Edge.
 DirectedEdge Edge.getDirEdge(Node fromNode)
          Returns the DirectedEdge that starts from the given node, or null if the node is not one of the two nodes associated with this Edge.
 DirectedEdge DirectedEdgeStar.getNextCWEdge(DirectedEdge dirEdge)
          Returns the DirectedEdge on the right-hand (CW) side of the given DirectedEdge (which must be a member of this DirectedEdgeStar).
 DirectedEdge DirectedEdgeStar.getNextEdge(DirectedEdge dirEdge)
          Returns the DirectedEdge on the left-hand (CCW) side of the given DirectedEdge (which must be a member of this DirectedEdgeStar).
 DirectedEdge DirectedEdge.getSym()
          Returns the symmetric DirectedEdge -- the other DirectedEdge associated with this DirectedEdge's parent Edge.
 

Methods in com.vividsolutions.jts.planargraph with parameters of type DirectedEdge
protected  void PlanarGraph.add(DirectedEdge dirEdge)
          Adds the Edge to this PlanarGraph; only subclasses can add DirectedEdges, to ensure the edges added are of the right class.
 void DirectedEdgeStar.add(DirectedEdge de)
          Adds a new member to this DirectedEdgeStar.
 void Node.addOutEdge(DirectedEdge de)
          Adds an outgoing DirectedEdge to this Node.
 int DirectedEdge.compareDirection(DirectedEdge e)
          Returns 1 if this DirectedEdge has a greater angle with the positive x-axis than b", 0 if the DirectedEdges are collinear, and -1 otherwise.
 boolean PlanarGraph.contains(DirectedEdge de)
          Tests whether this graph contains the given DirectedEdge
 int DirectedEdgeStar.getIndex(DirectedEdge dirEdge)
          Returns the zero-based index of the given DirectedEdge, after sorting in ascending order by angle with the positive x-axis.
 DirectedEdge DirectedEdgeStar.getNextCWEdge(DirectedEdge dirEdge)
          Returns the DirectedEdge on the right-hand (CW) side of the given DirectedEdge (which must be a member of this DirectedEdgeStar).
 DirectedEdge DirectedEdgeStar.getNextEdge(DirectedEdge dirEdge)
          Returns the DirectedEdge on the left-hand (CCW) side of the given DirectedEdge (which must be a member of this DirectedEdgeStar).
 void PlanarGraph.remove(DirectedEdge de)
          Removes a DirectedEdge from its from-Node and from this graph.
 void Node.remove(DirectedEdge de)
          Removes a DirectedEdge incident on this node.
 void DirectedEdgeStar.remove(DirectedEdge de)
          Drops a member of this DirectedEdgeStar.
 void Edge.setDirectedEdges(DirectedEdge de0, DirectedEdge de1)
          Initializes this Edge's two DirectedEdges, and for each DirectedEdge: sets the Edge, sets the symmetric DirectedEdge, and adds this Edge to its from-Node.
 void DirectedEdge.setSym(DirectedEdge sym)
          Sets this DirectedEdge's symmetric DirectedEdge, which runs in the opposite direction.
 

Constructors in com.vividsolutions.jts.planargraph with parameters of type DirectedEdge
Edge(DirectedEdge de0, DirectedEdge de1)
          Constructs an Edge initialized with the given DirectedEdges, and for each DirectedEdge: sets the Edge, sets the symmetric DirectedEdge, and adds this Edge to its from-Node.
 



Copyright © 2012. All Rights Reserved.