Directed edge in a graph (see class NstGraph)
Directed edge in a graph (see class NstGraph). Basic object.An edge is directed from a vertex (see class NstVertex) called the tail to a vertex called the head.
NstEdge()
virtual ~NstEdge()
void copy(const NstEdge & s, int deep = 0)
NstEdge* clone(int deep = 0)
void print(ostream &s) const
Nst_Edge_Type type() const
NstVertex* from() const
NstVertex* to() const
void from(NstVertex * const new_from)
void to(NstVertex * const new_to)
Alphabetic index HTML hierarchy of classes or Java