GEOS
3.4.2
|
A subgraph of a PlanarGraph. More...
#include <Subgraph.h>
Public Member Functions | |
Subgraph (PlanarGraph &parent) | |
PlanarGraph & | getParent () const |
std::pair< std::set< Edge * > ::iterator, bool > | add (Edge *e) |
std::vector< const DirectedEdge * >::iterator | getDirEdgeBegin () |
std::set< Edge * >::iterator | edgeBegin () |
std::set< Edge * >::iterator | edgeEnd () |
NodeMap::container::iterator | nodeBegin () |
NodeMap::container::const_iterator | nodeEnd () const |
NodeMap::container::iterator | nodeEnd () |
NodeMap::container::const_iterator | nodeBegin () const |
bool | contains (Edge *e) |
Protected Member Functions | |
Subgraph (const Subgraph &other) | |
Subgraph & | operator= (const Subgraph &rhs) |
Protected Attributes | |
PlanarGraph & | parentGraph |
std::set< Edge * > | edges |
std::vector< const DirectedEdge * > | dirEdges |
NodeMap | nodeMap |
A subgraph of a PlanarGraph.
A subgraph may contain any subset of geomgraph::Edges from the parent graph. It will also automatically contain all geomgraph::DirectedEdge and geomgraph::Node associated with those edges. No new objects are created when edges are added - all associated components must already exist in the parent graph.
@ Actually we'll be copying Coordinates in NodeMap. I guess that'll need to be changed soon.
|
inline |
Creates a new subgraph of the given PlanarGraph
parent | the parent graph |
Adds an Edge to the subgraph. The associated DirectedEdges and planarNodes are also added.
e | the edge to add |
|
inline |
Tests whether an Edge is contained in this subgraph
e | the edge to test |
true
if the edge is contained in this subgraph
|
inline |
|
inline |
Returns an iterator over the DirectedEdge in this graph, in the order in which they were added.
|
inline |
Gets the PlanarGraph which this subgraph is part of.
|
inline |
Returns a iterators over the planarNodesMap::container in this graph.