This class is used to define an edge growth of a pattern in this DFSTree. More...

#include <agrum/PRM/DFSTree.h>

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

Public Member Functions
	EdgeGrowth (NodeId a_u, LabelData an_edge, LabelData a_l_v, NodeId a_v=0)
	Constructor.
	EdgeGrowth (const EdgeGrowth &from)
	Copy constructor.
	~EdgeGrowth ()
	Destructor.
void	insert (PRMInstance< GUM_SCALAR > u, PRMInstance< GUM_SCALAR > v)
	Add the pair (u,v) as a match for the current growth.
std::string	toString ()
	Return a string representation of this.

Public Attributes
NodeId	u
	The id of the node from which we grow an edge.
LabelData *	edge
	The LabelData over the edge of this edge growth.
LabelData *	l_v
	The LabelData over the node of this edge growth.
NodeId	v
	If the growth is backward you must assigned the subscript of v, otherwise 0 is assigned (recall that subscripts start from 1).
NodeProperty< std::pair< PRMInstance< GUM_SCALAR > , PRMInstance< GUM_SCALAR > > >	matches
	The mapping between the u and v for each match in the interface graph.

Private Attributes
UndiGraph	iso_graph
	The iso graph for computing the maximum independent set of matches.
std::vector< NodeId > *	degree_list
	Vector used for computation.
Set< NodeId >	max_indep_set
	The max indep set of matches.

Friends
class	DFSTree< GUM_SCALAR >

Detailed Description

template<GUM_Numeric GUM_SCALAR>
class gum::prm::gspan::EdgeGrowth< GUM_SCALAR >

This class is used to define an edge growth of a pattern in this DFSTree.

Definition at line 73 of file edgeGrowth.h.

Constructor & Destructor Documentation

◆ EdgeGrowth() [1/2]

template<GUM_Numeric GUM_SCALAR>

gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::EdgeGrowth	(	NodeId	a_u,
		LabelData *	an_edge,
		LabelData *	a_l_v,
		NodeId	a_v = 0 )

Constructor.

Definition at line 58 of file edgeGrowth_tpl.h.

                                                           :
          u(a_u), edge(an_edge), l_v(a_l_v), v(a_v), degree_list(new std::vector< NodeId >()) {
        GUM_CONSTRUCTOR(EdgeGrowth);
      }

References EdgeGrowth(), degree_list, edge, l_v, u, and v.

Referenced by EdgeGrowth(), EdgeGrowth(), ~EdgeGrowth(), and DFSTree< GUM_SCALAR >.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ EdgeGrowth() [2/2]

template<GUM_Numeric GUM_SCALAR>

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

Copy constructor.

Definition at line 67 of file edgeGrowth_tpl.h.

                                                                               :
          u(from.u), edge(from.edge), v(from.v), matches(from.matches), iso_graph(from.iso_graph),
          degree_list(0), max_indep_set(from.max_indep_set) {
        GUM_CONS_CPY(EdgeGrowth);
 
        if (from.degree_list != 0) { degree_list = new std::vector< NodeId >(*(from.degree_list)); }
      }

References EdgeGrowth(), degree_list, edge, iso_graph, matches, max_indep_set, u, and v.

Here is the call graph for this function:

◆ ~EdgeGrowth()

template<GUM_Numeric GUM_SCALAR>

gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::~EdgeGrowth ( )

Destructor.

Definition at line 76 of file edgeGrowth_tpl.h.

                                            {
        GUM_DESTRUCTOR(EdgeGrowth);
 
        if (degree_list != 0) { delete degree_list; }
      }

References EdgeGrowth(), and degree_list.

Here is the call graph for this function:

Member Function Documentation

◆ insert()

template<GUM_Numeric GUM_SCALAR>

void gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::insert	(	PRMInstance< GUM_SCALAR > *	u,
		PRMInstance< GUM_SCALAR > *	v )

Add the pair (u,v) as a match for the current growth.

Definition at line 90 of file edgeGrowth_tpl.h.

                                                                          {
        NodeId id = iso_graph.addNode();
        degree_list->push_back(id);
 
        for (const auto& elt: matches) {
          if ((elt.second.first == u) || (elt.second.second == u) || (elt.second.first == v)
              || (elt.second.second == v)) {
            iso_graph.addEdge(elt.first, id);
          }
        }
 
        // The order between u and v is important ! DO NOT INVERSE IT !
        matches.insert(id, std::make_pair(u, v));
      }

References degree_list, iso_graph, matches, u, and v.

Referenced by gum::prm::GSpan< GUM_SCALAR >::_subgraph_mining_().

Here is the caller graph for this function:

◆ toString()

template<GUM_Numeric GUM_SCALAR>

std::string gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::toString ( )

Return a string representation of this.

Definition at line 83 of file edgeGrowth_tpl.h.

                                                   {
        std::stringstream str;
        str << u << "-" << edge << "-" << l_v << "-" << v;
        return str.str();
      }