Inner class to handle data about edges in __graph. More...

#include <agrum/PRM/gspan/interfaceGraph.h>

Collaboration diagram for gum::prm::gspan::EdgeData< GUM_SCALAR >:

Public Attributes
PRMInstance< GUM_SCALAR > *	u
	One of the two instance represented by this edge. More...

LabelData *	l_u
	The label data of u. More...

PRMInstance< GUM_SCALAR > *	v
	The other instance represented by thus edge. More...

LabelData *	l_v
	The label data of v. More...

LabelData *	l
	The labal data of this edge. More...

Public Member Functions
	EdgeData ()
	Constructor. More...

	EdgeData (const EdgeData< GUM_SCALAR > &from)
	Copy constructor. More...

	~EdgeData ()
	Destructor. More...

bool	operator== (const EdgeData< GUM_SCALAR > &from) const
	Equality operator. More...

bool	operator!= (const EdgeData< GUM_SCALAR > &from) const
	Difference operator. More...

Detailed Description

template<typename GUM_SCALAR>
struct gum::prm::gspan::EdgeData< GUM_SCALAR >

Inner class to handle data about edges in __graph.

Definition at line 116 of file interfaceGraph.h.

Constructor & Destructor Documentation

◆ EdgeData() [1/2]

template<typename GUM_SCALAR >

INLINE gum::prm::gspan::EdgeData< GUM_SCALAR >::EdgeData ( )

Constructor.

Definition at line 67 of file interfaceGraph_tpl.h.

                                               : u(0), v(0), l(0) {
         GUM_CONSTRUCTOR(EdgeData);
       }

◆ EdgeData() [2/2]

template<typename GUM_SCALAR >

INLINE gum::prm::gspan::EdgeData< GUM_SCALAR >::EdgeData ( const EdgeData< GUM_SCALAR > & from )

Copy constructor.

Definition at line 72 of file interfaceGraph_tpl.h.

                                                                                 :
           u(from.u), v(from.v), l(from.l) {
         GUM_CONS_CPY(EdgeData);
       }

◆ ~EdgeData()

template<typename GUM_SCALAR >

INLINE gum::prm::gspan::EdgeData< GUM_SCALAR >::~EdgeData ( )

Destructor.

Definition at line 78 of file interfaceGraph_tpl.h.

References gum::prm::gspan::EdgeData< GUM_SCALAR >::operator==().

                                                {
         GUM_DESTRUCTOR(EdgeData);
       }

Here is the call graph for this function:

Member Function Documentation

◆ operator!=()

template<typename GUM_SCALAR >

INLINE bool gum::prm::gspan::EdgeData< GUM_SCALAR >::operator!= ( const EdgeData< GUM_SCALAR > & from ) const

Difference operator.

Definition at line 91 of file interfaceGraph_tpl.h.

References gum::prm::gspan::EdgeData< GUM_SCALAR >::l, gum::prm::gspan::EdgeData< GUM_SCALAR >::l_u, gum::prm::gspan::EdgeData< GUM_SCALAR >::l_v, gum::prm::gspan::EdgeData< GUM_SCALAR >::u, and gum::prm::gspan::EdgeData< GUM_SCALAR >::v.

Referenced by gum::prm::gspan::EdgeData< GUM_SCALAR >::operator==().

                                                                        {
         return (u != from.u) && (l_u != from.l_u) && (v != from.v)
                && (l_v != from.l_v) && (l != from.l);
       }

Here is the caller graph for this function:

◆ operator==()

template<typename GUM_SCALAR >

INLINE bool gum::prm::gspan::EdgeData< GUM_SCALAR >::operator== ( const EdgeData< GUM_SCALAR > & from ) const

Equality operator.

Definition at line 84 of file interfaceGraph_tpl.h.

References gum::prm::gspan::EdgeData< GUM_SCALAR >::l, gum::prm::gspan::EdgeData< GUM_SCALAR >::l_u, gum::prm::gspan::EdgeData< GUM_SCALAR >::l_v, gum::prm::gspan::EdgeData< GUM_SCALAR >::operator!=(), gum::prm::gspan::EdgeData< GUM_SCALAR >::u, and gum::prm::gspan::EdgeData< GUM_SCALAR >::v.

Referenced by gum::prm::gspan::EdgeData< GUM_SCALAR >::~EdgeData().

                                                                        {
         return (u == from.u) && (l_u == from.l_u) && (v == from.v)
                && (l_v == from.l_v) && (l == from.l);
       }