18#include <geos/export.h>
19#include <geos/planargraph/PlanarGraph.h>
42class GEOS_DLL ConnectedSubgraphFinder {
81 void addEdges(
Node* node, std::stack<Node*>& nodeStack,
85 ConnectedSubgraphFinder(
const ConnectedSubgraphFinder& other) =
delete;
86 ConnectedSubgraphFinder& operator=(
const ConnectedSubgraphFinder& rhs) =
delete;
A node in a PlanarGraph is a location where 0 or more Edge meet.
Definition planargraph/Node.h:44
Represents a directed graph which is embeddable in a planar surface.
Definition planargraph/PlanarGraph.h:59
A subgraph of a PlanarGraph.
Definition Subgraph.h:52
void getConnectedSubgraphs(std::vector< Subgraph * > &dest)
Store newly allocated connected Subgraphs into the given std::vector.
Planargraph algorithms.
Definition namespaces.h:296
Contains classes to implement a planar graph data structure.
Definition namespaces.h:293
Basic namespace for all GEOS functionalities.
Definition geos.h:39