HDK
|
#include <Traversal.h>
Public Member Functions | |
Edge (ElementPtr elemDown, ElementPtr elemConnect, ElementPtr elemUp) | |
~Edge () | |
bool | operator== (const Edge &rhs) const |
bool | operator!= (const Edge &rhs) const |
bool | operator< (const Edge &rhs) const |
operator bool () const | |
ElementPtr | getDownstreamElement () const |
Return the downstream element of the edge. More... | |
ElementPtr | getConnectingElement () const |
Return the connecting element of the edge, if any. More... | |
ElementPtr | getUpstreamElement () const |
Return the upstream element of the edge. More... | |
string | getName () const |
Return the name of this edge, if any. More... | |
An edge between two connected Elements, returned during graph traversal.
A valid Edge consists of a downstream element, an upstream element, and optionally a connecting element that binds them. As an example, the edge between two Node elements will contain a connecting element for the Input of the downstream Node.
Definition at line 29 of file Traversal.h.
|
inline |
Definition at line 32 of file Traversal.h.
|
inline |
Definition at line 38 of file Traversal.h.
|
inline |
Return the connecting element of the edge, if any.
Definition at line 64 of file Traversal.h.
|
inline |
Return the downstream element of the edge.
Definition at line 58 of file Traversal.h.
string Edge::getName | ( | ) | const |
Return the name of this edge, if any.
|
inline |
Return the upstream element of the edge.
Definition at line 70 of file Traversal.h.
Edge::operator bool | ( | ) | const |
|
inline |
Definition at line 46 of file Traversal.h.
|
inline |
Definition at line 50 of file Traversal.h.
|
inline |
Definition at line 40 of file Traversal.h.