GEOS
3.9.1dev
|
A subgraph of a PlanarGraph. More...
#include <Subgraph.h>
Public Member Functions | |
Subgraph (PlanarGraph &parent) | |
Creates a new subgraph of the given PlanarGraph. More... | |
PlanarGraph & | getParent () const |
Gets the PlanarGraph which this subgraph is part of. More... | |
std::pair< std::set< Edge * >::iterator, bool > | add (Edge *e) |
Adds an Edge to the subgraph. More... | |
std::vector< const DirectedEdge * >::iterator | getDirEdgeBegin () |
Returns an iterator over the DirectedEdge in this graph, in the order in which they were added. More... | |
std::set< Edge * >::iterator | edgeBegin () |
Returns an iterator over the Edges in this graph, in the order in which they were added. More... | |
std::set< Edge * >::iterator | edgeEnd () |
NodeMap::container::iterator | nodeBegin () |
Returns a iterators over the planar NodeMap::container in this graph. More... | |
NodeMap::container::const_iterator | nodeEnd () const |
NodeMap::container::iterator | nodeEnd () |
NodeMap::container::const_iterator | nodeBegin () const |
bool | contains (Edge *e) |
Tests whether an Edge is contained in this subgraph. More... | |
Protected Member Functions | |
Subgraph (const Subgraph &other)=delete | |
Subgraph & | operator= (const Subgraph &rhs)=delete |
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 Edges from the parent graph. It will also automatically contain all DirectedEdges and Nodes associated with those edges. No new objects are created when edges are added - all associated components must already exist in the parent graph.
Definition at line 53 of file Subgraph.h.
|
inline |
Creates a new subgraph of the given PlanarGraph.
parent | the parent graph |
Definition at line 60 of file Subgraph.h.
|
protecteddelete |
Adds an Edge to the subgraph.
The associated DirectedEdges and Nodes 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 Definition at line 159 of file Subgraph.h.
|
inline |
Returns an iterator over the Edges in this graph, in the order in which they were added.
Definition at line 117 of file Subgraph.h.
|
inline |
Definition at line 122 of file Subgraph.h.
|
inline |
Returns an iterator over the DirectedEdge in this graph, in the order in which they were added.
Definition at line 102 of file Subgraph.h.
|
inline |
Gets the PlanarGraph which this subgraph is part of.
Definition at line 72 of file Subgraph.h.
|
inline |
Returns a iterators over the planar NodeMap::container in this graph.
Definition at line 132 of file Subgraph.h.
|
inline |
Definition at line 147 of file Subgraph.h.
|
inline |
Definition at line 137 of file Subgraph.h.
|
inline |
Definition at line 142 of file Subgraph.h.
|
protected |
Definition at line 168 of file Subgraph.h.
|
protected |
Definition at line 167 of file Subgraph.h.
|
protected |
Definition at line 169 of file Subgraph.h.
|
protected |
Definition at line 166 of file Subgraph.h.