17 #ifndef GEOS_PLANARGRAPH_DIRECTEDEDGESTAR_H
18 #define GEOS_PLANARGRAPH_DIRECTEDEDGESTAR_H
20 #include <geos/export.h>
27 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class
35 namespace planargraph {
42 namespace planargraph {
54 mutable std::vector<DirectedEdge*> outEdges;
56 void sortEdges()
const;
69 void add(DirectedEdge *de);
74 void remove(DirectedEdge *de);
80 std::vector<DirectedEdge*>::iterator
iterator() {
return begin(); }
82 std::vector<DirectedEdge*>::iterator begin();
85 std::vector<DirectedEdge*>::iterator end();
88 std::vector<DirectedEdge*>::const_iterator begin()
const;
91 std::vector<DirectedEdge*>::const_iterator end()
const;
97 std::size_t
getDegree()
const {
return outEdges.size(); }
109 std::vector<DirectedEdge*>& getEdges();
116 int getIndex(
const Edge *edge);
129 int getIndex(
int i)
const;
146 #endif // GEOS_PLANARGRAPH_DIRECTEDEDGESTAR_H
DirectedEdgeStar()
Constructs a DirectedEdgeStar with no edges.
Definition: planargraph/DirectedEdgeStar.h:62
A sorted collection of DirectedEdge which leave a Node in a PlanarGraph.
Definition: planargraph/DirectedEdgeStar.h:47
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
std::size_t getDegree() const
Returns the number of edges around the Node associated with this DirectedEdgeStar.
Definition: planargraph/DirectedEdgeStar.h:97
std::vector< DirectedEdge * >::iterator iterator()
Returns an Iterator over the DirectedEdges, in ascending order by angle with the positive x-axis...
Definition: planargraph/DirectedEdgeStar.h:80
Represents an undirected edge of a PlanarGraph.
Definition: planargraph/Edge.h:55