Graph edge class, base class of all edges. An edge connects two subjects.
![]() | Edge (Graph *g, Subject *n1, Subject *n2) |
![]() | ~Edge () |
![]() | GetSubject1 () const edge connects subject1 and subject2. |
![]() | GetSubject2 () const when edge is directed then subject1 is 'from' and subject2 'to'. |
![]() | SetSubject1 (Subject *n) |
![]() | SetSubject2 (Subject *n) |
![]() | IsDirected () const |
![]() | InGraph () const is edge part of the graph? |
![]() | IsEdge () const yes of course it is |
![]() | PartOf (Subject *subject) const is subject one of the two subjects that edge connects? |
![]() | SetSubjects (Subject *n1, Subject *n2, bool d = 0) set it all |
![]() | WriteMembers (OutputFile *f) write attributes to file. |
![]() | ReadMembers (InputFile *f, double format) read and check attributes from file. |
![]() | SetReferences (AssocList *) set and check references to subjects after reading. |
![]() | CheckReferences () check whether subject references exist. |
![]() | SetDirected (bool b) |
Graph edge class, base class of all edges. An edge connects two subjects.
virtual ~Edge()
Subject* GetSubject1() const
Subject* GetSubject2() const
void SetSubject1(Subject *n)
void SetSubject2(Subject *n)
bool IsDirected() const
bool InGraph() const
bool IsEdge() const
bool PartOf(Subject *subject) const
void SetSubjects(Subject *n1, Subject *n2, bool d = 0)
void WriteMembers(OutputFile *f)
bool ReadMembers(InputFile *f, double format)
bool SetReferences(AssocList *)
bool CheckReferences()
alphabetic index hierarchy of classes
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de