17 #ifndef GEOS_PLANARGRAPH_DIRECTEDEDGE_H
18 #define GEOS_PLANARGRAPH_DIRECTEDEDGE_H
20 #include <geos/export.h>
21 #include <geos/planargraph/GraphComponent.h>
22 #include <geos/geom/Coordinate.h>
29 namespace planargraph {
36 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);
106 bool newEdgeDirection);
112 Edge* getEdge()
const;
118 void setEdge(
Edge* newParentEdge);
124 int getQuadrant()
const;
136 bool getEdgeDirection()
const;
141 Node* getFromNode()
const;
146 Node* getToNode()
const;
159 double getAngle()
const;
222 std::string print()
const;
234 #endif // GEOS_PLANARGRAPH_DIRECTEDEDGE_H
bool pdeLessThan(DirectedEdge *first, DirectedEdge *second)
Strict Weak comparator function for containers.
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:61
Represents a directed edge in a PlanarGraph.
Definition: planargraph/DirectedEdge.h:47
Represents an undirected edge of a PlanarGraph.
Definition: planargraph/Edge.h:55
The base class for all graph component classes.
Definition: planargraph/GraphComponent.h:47
A node in a PlanarGraph is a location where 0 or more Edge meet.
Definition: planargraph/Node.h:46