18 #include <geos/export.h> 19 #include <geos/planargraph/GraphComponent.h> 20 #include <geos/geom/Coordinate.h> 27 namespace planargraph {
34 namespace planargraph {
51 typedef std::list<DirectedEdge*> NonConstList;
52 typedef std::list<const DirectedEdge*> ConstList;
53 typedef std::vector<DirectedEdge*> NonConstVect;
66 typedef std::vector<const DirectedEdge*> ConstVect;
67 typedef std::vector<DirectedEdge*> Vect;
78 static std::vector<Edge*>* toEdges(
79 std::vector<DirectedEdge*>& dirEdges);
89 static void toEdges(std::vector<DirectedEdge*>& dirEdges,
90 std::vector<Edge*>& parentEdges);
108 bool newEdgeDirection);
114 Edge* getEdge()
const;
120 void setEdge(
Edge* newParentEdge);
126 int getQuadrant()
const;
138 bool getEdgeDirection()
const;
143 Node* getFromNode()
const;
148 Node* getToNode()
const;
161 double getAngle()
const;
224 std::string print()
const;
bool pdeLessThan(DirectedEdge *first, DirectedEdge *second)
Strict Weak comparator function for containers.
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:216
Represents a directed edge in a PlanarGraph.
Definition: planargraph/DirectedEdge.h:45
Basic namespace for all GEOS functionalities.
Definition: Angle.h:25
Represents an undirected edge of a PlanarGraph.
Definition: planargraph/Edge.h:54
The base class for all graph component classes.
Definition: planargraph/GraphComponent.h:45
A node in a PlanarGraph is a location where 0 or more Edge meet.
Definition: planargraph/Node.h:44
std::ostream & operator<<(std::ostream &, const DirectedEdge &)
Output operator.