16 #ifndef GEOS_PLANARGRAPH_SUBGRAPH_H 17 #define GEOS_PLANARGRAPH_SUBGRAPH_H 19 #include <geos/export.h> 20 #include <geos/planargraph/NodeMap.h> 26 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class 31 namespace planargraph {
39 namespace planargraph {
87 std::pair<std::set<Edge*>::iterator,
bool> add(
Edge *e);
98 return dirEdges.begin();
110 std::set<Edge*>::iterator
edgeBegin() {
return edges.begin(); }
111 std::set<Edge*>::iterator edgeEnd() {
return edges.end(); }
118 return nodeMap.begin();
120 NodeMap::container::const_iterator nodeEnd()
const {
121 return nodeMap.end();
123 NodeMap::container::iterator nodeEnd() {
124 return nodeMap.end();
126 NodeMap::container::const_iterator nodeBegin()
const {
127 return nodeMap.begin();
140 std::set<Edge*> edges;
141 std::vector<const DirectedEdge*> dirEdges;
156 #endif // GEOS_PLANARGRAPH_SUBGRAPH_H Subgraph(PlanarGraph &parent)
Definition: Subgraph.h:61
std::set< Edge * >::iterator edgeBegin()
Definition: Subgraph.h:110
NodeMap::container::iterator nodeBegin()
Definition: Subgraph.h:117
PlanarGraph & getParent() const
Definition: Subgraph.h:72
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:25
bool contains(Edge *e)
Definition: Subgraph.h:135
Represents an undirected edge of a PlanarGraph.
Definition: planargraph/Edge.h:54
std::vector< const DirectedEdge * >::iterator getDirEdgeBegin()
Definition: Subgraph.h:97
A subgraph of a PlanarGraph.
Definition: Subgraph.h:53
A map of Node, indexed by the coordinate of the node.
Definition: planargraph/NodeMap.h:48
Represents a directed graph which is embeddable in a planar surface.
Definition: planargraph/PlanarGraph.h:60