16#ifndef GEOS_PLANARGRAPH_ALGO_CONNECTEDSUBGRAPHFINDER_H
17#define GEOS_PLANARGRAPH_ALGO_CONNECTEDSUBGRAPHFINDER_H
19#include <geos/export.h>
20#include <geos/planargraph/PlanarGraph.h>
43class GEOS_DLL ConnectedSubgraphFinder
83 void addEdges(
Node* node, std::stack<Node *>& nodeStack,
87 ConnectedSubgraphFinder(
const ConnectedSubgraphFinder& other);
88 ConnectedSubgraphFinder& operator=(
const ConnectedSubgraphFinder& rhs);
A node in a PlanarGraph is a location where 0 or more Edge meet.
Definition planargraph/Node.h:45
Represents a directed graph which is embeddable in a planar surface.
Definition planargraph/PlanarGraph.h:60
A subgraph of a PlanarGraph.
Definition Subgraph.h:54
void getConnectedSubgraphs(std::vector< Subgraph * > &dest)
Store newly allocated connected Subgraphs into the given std::vector.
Planargraph algorithms.
Definition planargraph.h:25
Contains classes to implement a planar graph data structure.
Definition LineMergeDirectedEdge.h:32
Basic namespace for all GEOS functionalities.
Definition IndexedNestedRingTester.h:25