aGrUM
0.13.2

The base class for all directed edgesThis class is used as a basis for manipulating all directed edges (i.e., edges in which the order of the nodes is meaningful). More...
#include <graphElements.h>
Public Member Functions  
Constructors / Destructors  
Arc (NodeId tail, NodeId head)  
basic constructor. Creates tail > head. More...  
Arc (const Arc &src)  
copy constructor More...  
~Arc ()  
destructor More...  
Accessors  
NodeId  tail () const 
returns the tail of the arc More...  
NodeId  head () const 
returns the head of the arc More...  
NodeId  other (NodeId id) const 
returns an extremal node of an edge given the ID of the other one More...  
NodeId  first () const 
returns one extremal node ID (whichever one it is is unspecified) More...  
NodeId  second () const 
returns the node ID of the other extremal node ID More...  
Operators  
Arc &  operator= (const Arc &src) 
copy operator More...  
bool  operator== (const Arc &src) const 
checks whether two arcs are equal More...  
bool  operator!= (const Arc &src) const 
check if two arcs are different More...  
The base class for all directed edges
This class is used as a basis for manipulating all directed edges (i.e., edges in which the order of the nodes is meaningful).
For instance, in an arrow, one node is near the head and the other one is farther, hence these nodes have different status and swapping the nodes results in reversing the direction of the arrow. Thus, the nodes in an arrow can be thought of as asymmetric and the arrow's graphical representation contains a pointed extremity so as to account for this asymmetry. In aGrUM, the latter is taken into account by Arc.
Definition at line 250 of file graphElements.h.
basic constructor. Creates tail > head.
gum::Arc::Arc  (  const Arc &  src  ) 
copy constructor
gum::Arc::~Arc  (  ) 
destructor

private 
modifies the head of the arc

private 
modifies the tail of the arc
NodeId gum::Arc::first  (  )  const 
returns one extremal node ID (whichever one it is is unspecified)
Referenced by gum::BarrenNodesFinder::barrenNodes().
NodeId gum::Arc::head  (  )  const 
returns the head of the arc
Referenced by gum::BarrenNodesFinder::barrenNodes(), gum::ArcGraphPart::eraseArc(), gum::InfluenceDiagram< GUM_SCALAR >::eraseArc(), gum::BayesNet< GUM_SCALAR >::eraseArc(), gum::DAGCycleDetector::hasCycleFromModifications(), and gum::BayesNet< GUM_SCALAR >::reverseArc().
check if two arcs are different
Two arcs are considered different if they have different head and/or tail (by different we mean they have different ID).

private 
reverses the direction of the arc
checks whether two arcs are equal
Two arcs are considered equal if they have the same head and tail (by same we mean they have the same ID).
returns an extremal node of an edge given the ID of the other one
NodeId gum::Arc::second  (  )  const 
returns the node ID of the other extremal node ID
NodeId gum::Arc::tail  (  )  const 
returns the tail of the arc
Referenced by gum::BarrenNodesFinder::barrenNodes(), gum::ArcGraphPart::eraseArc(), gum::InfluenceDiagram< GUM_SCALAR >::eraseArc(), gum::BayesNet< GUM_SCALAR >::eraseArc(), gum::DAGCycleDetector::hasCycleFromModifications(), and gum::BayesNet< GUM_SCALAR >::reverseArc().

private 
the extremal nodes of the edge (their order is unimportant)
Definition at line 314 of file graphElements.h.

private 
Definition at line 314 of file graphElements.h.