aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
gum::prm::gspan::EdgeData< GUM_SCALAR > Struct Template Reference

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 Member Functions

 EdgeData ()
 Constructor.
 EdgeData (const EdgeData< GUM_SCALAR > &from)
 Copy constructor.
 ~EdgeData ()
 Destructor.
bool operator== (const EdgeData< GUM_SCALAR > &from) const
 Equality operator.
bool operator!= (const EdgeData< GUM_SCALAR > &from) const
 Difference operator.

Public Attributes

PRMInstance< GUM_SCALAR > * u
 One of the two instance represented by this edge.
LabelDatal_u
 The label data of u.
PRMInstance< GUM_SCALAR > * v
 The other instance represented by thus edge.
LabelDatal_v
 The label data of v.
LabelDatal
 The labal data of this edge.

Detailed Description

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

Inner class to handle data about edges in graph.

Definition at line 132 of file interfaceGraph.h.

Constructor & Destructor Documentation

◆ EdgeData() [1/2]

template<GUM_Numeric GUM_SCALAR>
gum::prm::gspan::EdgeData< GUM_SCALAR >::EdgeData ( )

Constructor.

Definition at line 86 of file interfaceGraph_tpl.h.

86 : u(0), v(0), l(0) {
88 }
Inner class to handle data about edges in graph.
PRMInstance< GUM_SCALAR > * v
The other instance represented by thus edge.
PRMInstance< GUM_SCALAR > * u
One of the two instance represented by this edge.
LabelData * l
The labal data of this edge.

References EdgeData(), l, u, and v.

Referenced by EdgeData(), EdgeData(), ~EdgeData(), operator!=(), and operator==().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ EdgeData() [2/2]

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

Copy constructor.

Definition at line 91 of file interfaceGraph_tpl.h.

91 :
92 u(from.u), v(from.v), l(from.l) {
94 }

References EdgeData(), l, u, and v.

Here is the call graph for this function:

◆ ~EdgeData()

template<GUM_Numeric GUM_SCALAR>
gum::prm::gspan::EdgeData< GUM_SCALAR >::~EdgeData ( )

Destructor.

Definition at line 97 of file interfaceGraph_tpl.h.

97 {
99 }

References EdgeData().

Here is the call graph for this function:

Member Function Documentation

◆ operator!=()

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

Difference operator.

Definition at line 108 of file interfaceGraph_tpl.h.

108 {
109 return (u != from.u) && (l_u != from.l_u) && (v != from.v) && (l_v != from.l_v)
110 && (l != from.l);
111 }
LabelData * l_u
The label data of u.
LabelData * l_v
The label data of v.

References EdgeData(), l, l_u, l_v, u, and v.

Here is the call graph for this function:

◆ operator==()

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

Equality operator.

Definition at line 102 of file interfaceGraph_tpl.h.

102 {
103 return (u == from.u) && (l_u == from.l_u) && (v == from.v) && (l_v == from.l_v)
104 && (l == from.l);
105 }

References EdgeData(), l, l_u, l_v, u, and v.

Here is the call graph for this function:

Member Data Documentation

◆ l

◆ l_u

template<GUM_Numeric GUM_SCALAR>
LabelData* gum::prm::gspan::EdgeData< GUM_SCALAR >::l_u

◆ l_v

template<GUM_Numeric GUM_SCALAR>
LabelData* gum::prm::gspan::EdgeData< GUM_SCALAR >::l_v

◆ u

template<GUM_Numeric GUM_SCALAR>
PRMInstance< GUM_SCALAR >* gum::prm::gspan::EdgeData< GUM_SCALAR >::u

One of the two instance represented by this edge.

Definition at line 141 of file interfaceGraph.h.

Referenced by EdgeData(), EdgeData(), gum::prm::GSpan< GUM_SCALAR >::_subgraph_mining_(), operator!=(), gum::prm::gspan::operator<<(), and operator==().

◆ v

template<GUM_Numeric GUM_SCALAR>
PRMInstance< GUM_SCALAR >* gum::prm::gspan::EdgeData< GUM_SCALAR >::v

The other instance represented by thus edge.

Definition at line 145 of file interfaceGraph.h.

Referenced by EdgeData(), EdgeData(), operator!=(), gum::prm::gspan::operator<<(), and operator==().


The documentation for this struct was generated from the following files: