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 Attributes
NodeId	u
	The id of the node from which we grow an edge. More...

LabelData *	edge
	The LabelData over the edge of this edge growth. More...

LabelData *	l_v
	The LabelData over the node of this edge growth. More...

NodeId	v
	If the growth is backward you must assigned the subscript of v, otherwise 0 is assigned (recall that subscripts start from 1) More...

NodeProperty< std::pair< PRMInstance< GUM_SCALAR > , PRMInstance< GUM_SCALAR > > >	matches
	The mapping between the u and v for each match in the interface graph. More...

Public Member Functions
	EdgeGrowth (NodeId a_u, LabelData an_edge, LabelData a_l_v, NodeId a_v=0)
	Constructor. More...

	EdgeGrowth (const EdgeGrowth &from)
	Copy constructor. More...

	~EdgeGrowth ()
	Destructor. More...

void	insert (PRMInstance< GUM_SCALAR > u, PRMInstance< GUM_SCALAR > v)
	Add the pair (u,v) as a match for the current growth. More...

std::string	toString ()
	Return a string representation of this. More...

Friends
class	DFSTree< GUM_SCALAR >

Detailed Description

template<typename 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 60 of file edgeGrowth.h.

Constructor & Destructor Documentation

◆ EdgeGrowth() [1/2]

template<typename GUM_SCALAR >

INLINE 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 34 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);
       }

◆ EdgeGrowth() [2/2]

template<typename GUM_SCALAR >

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

Copy constructor.

Definition at line 45 of file edgeGrowth_tpl.h.

References gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::degree_list.

                                                :
           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));
         }
       }

◆ ~EdgeGrowth()

template<typename GUM_SCALAR >

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

Destructor.

Definition at line 59 of file edgeGrowth_tpl.h.

References gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::degree_list.

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

Member Function Documentation

◆ insert()

template<typename 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 73 of file edgeGrowth_tpl.h.

References gum::UndiGraph::addEdge(), gum::NodeGraphPart::addNode(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::degree_list, gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::iso_graph, and gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::matches.

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

                                                                           {
         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));
       }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ toString()

template<typename GUM_SCALAR >

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

Return a string representation of this.

Definition at line 66 of file edgeGrowth_tpl.h.

References gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::edge, gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::l_v, gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::u, and gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::v.

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

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