|
| PolygonizeDirectedEdge (planargraph::Node *newFrom, planargraph::Node *newTo, const geom::Coordinate &newDirectionPt, bool nEdgeDirection) |
|
long | getLabel () const |
|
void | setLabel (long newLabel) |
|
PolygonizeDirectedEdge * | getNext () const |
|
EdgeRing * | getRing () const |
|
void | setNext (PolygonizeDirectedEdge *newNext) |
|
bool | isInRing () const |
|
void | setRing (EdgeRing *newEdgeRing) |
|
| DirectedEdge (Node *newFrom, Node *newTo, const geom::Coordinate &directionPt, bool newEdgeDirection) |
| Constructs a DirectedEdge connecting the from node to the to node. More...
|
|
Edge * | getEdge () const |
| Returns this DirectedEdge's parent Edge, or null if it has none. More...
|
|
void | setEdge (Edge *newParentEdge) |
| Associates this DirectedEdge with an Edge (possibly null, indicating no associated Edge). More...
|
|
int | getQuadrant () const |
| Returns 0, 1, 2, or 3, indicating the quadrant in which this DirectedEdge's orientation lies. More...
|
|
const geom::Coordinate & | getDirectionPt () const |
| Returns a point to which an imaginary line is drawn from the from-node to specify this DirectedEdge's orientation. More...
|
|
bool | getEdgeDirection () const |
| Returns whether the direction of the parent Edge (if any) is the same as that of this Directed Edge. More...
|
|
Node * | getFromNode () const |
| Returns the node from which this DirectedEdge leaves. More...
|
|
Node * | getToNode () const |
| Returns the node to which this DirectedEdge goes. More...
|
|
geom::Coordinate & | getCoordinate () const |
| Returns the coordinate of the from-node. More...
|
|
double | getAngle () const |
| Returns the angle that the start of this DirectedEdge makes with the positive x-axis, in radians. More...
|
|
DirectedEdge * | getSym () const |
| Returns the symmetric DirectedEdge – the other DirectedEdge associated with this DirectedEdge's parent Edge. More...
|
|
void | setSym (DirectedEdge *newSym) |
| Sets this DirectedEdge's symmetric DirectedEdge, which runs in the opposite direction. More...
|
|
int | compareTo (const DirectedEdge *obj) const |
| Returns 1 if this DirectedEdge has a greater angle with the positive x-axis than b", 0 if the DirectedEdges are collinear, and -1 otherwise. More...
|
|
int | compareDirection (const DirectedEdge *e) const |
| Returns 1 if this DirectedEdge has a greater angle with the positive x-axis than b", 0 if the DirectedEdges are collinear, and -1 otherwise. More...
|
|
std::string | print () const |
| Prints a detailed string representation of this DirectedEdge to the given PrintStream. More...
|
|
| GraphComponent () |
|
virtual | ~GraphComponent () |
|
virtual bool | isVisited () const |
| Tests if a component has been visited during the course of a graph algorithm. More...
|
|
virtual void | setVisited (bool p_isVisited) |
| Sets the visited flag for this component. More...
|
|
virtual bool | isMarked () const |
| Tests if a component has been marked at some point during the processing involving this graph. More...
|
|
virtual void | setMarked (bool p_isMarked) |
| Sets the marked flag for this component. More...
|
|
|
typedef std::list< DirectedEdge * > | NonConstList |
|
typedef std::list< const DirectedEdge * > | ConstList |
|
typedef std::vector< DirectedEdge * > | NonConstVect |
|
typedef std::vector< const DirectedEdge * > | ConstVect |
|
typedef std::vector< DirectedEdge * > | Vect |
|
static std::vector< Edge * > * | toEdges (std::vector< DirectedEdge * > &dirEdges) |
| Returns a List containing the parent Edge (possibly null) for each of the given DirectedEdges. More...
|
|
static void | toEdges (std::vector< DirectedEdge * > &dirEdges, std::vector< Edge * > &parentEdges) |
| Add parent Edge (possibly null) of each of the given DirectedEdges to the given parentEdges vector. More...
|
|
template<typename T > |
static void | setVisited (T start, T end, bool visited) |
| Sets the Visited state for the elements of a container, from start to end iterator. More...
|
|
template<typename T > |
static void | setVisitedMap (T start, T end, bool visited) |
| Sets the Visited state for the values of each map container element, from start to end iterator. More...
|
|
template<typename T > |
static void | setMarked (T start, T end, bool marked) |
| Sets the Marked state for the elements of a container, from start to end iterator. More...
|
|
template<typename T > |
static void | setMarkedMap (T start, T end, bool marked) |
| Sets the Marked state for the values of each map container element, from start to end iterator. More...
|
|
Edge * | parentEdge |
|
Node * | from |
|
Node * | to |
|
geom::Coordinate | p0 |
|
geom::Coordinate | p1 |
|
DirectedEdge * | sym |
|
bool | edgeDirection |
|
int | quadrant |
|
double | angle |
|
bool | isMarkedVar |
| Variable holding ''marked'' status. More...
|
|
bool | isVisitedVar |
| Variable holding ''visited'' status. More...
|
|
A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph.
May be logically deleted from the graph by setting the marked
flag.
Definition at line 54 of file PolygonizeDirectedEdge.h.