aGrUM  0.13.2
gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort Class Reference

This is used to generate the max_indep_set of a Pattern. More...

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

+ Collaboration diagram for gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort:

Public Attributes

UndiGraphg
 The isomorphism graph. More...
 

Public Member Functions

 NeighborDegreeSort (UndiGraph &graph)
 Constructor. More...
 
 NeighborDegreeSort (const NeighborDegreeSort &source)
 Copy constructor. More...
 
 ~NeighborDegreeSort ()
 Destructor. More...
 
bool operator() (NodeId i, NodeId j)
 The operator used to sort stuff. More...
 

Detailed Description

template<typename GUM_SCALAR>
class gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort

This is used to generate the max_indep_set of a Pattern.

Definition at line 244 of file DFSTree.h.

Constructor & Destructor Documentation

template<typename GUM_SCALAR >
INLINE gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::NeighborDegreeSort ( UndiGraph graph)
explicit

Constructor.

Definition at line 540 of file DFSTree_tpl.h.

541  :
542  g(graph) {
543  GUM_CONSTRUCTOR(DFSTree< GUM_SCALAR >::NeighborDegreeSort);
544  }
UndiGraph & g
The isomorphism graph.
Definition: DFSTree.h:254
const InterfaceGraph< GUM_SCALAR > & graph() const
Returns the list of root patterns in this DFSTree.
Definition: DFSTree_tpl.h:497
template<typename GUM_SCALAR >
INLINE gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::NeighborDegreeSort ( const NeighborDegreeSort source)

Copy constructor.

Definition at line 547 of file DFSTree_tpl.h.

548  :
549  g(source.g) {
550  GUM_CONS_CPY(DFSTree< GUM_SCALAR >::NeighborDegreeSort);
551  }
UndiGraph & g
The isomorphism graph.
Definition: DFSTree.h:254
template<typename GUM_SCALAR >
INLINE gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::~NeighborDegreeSort ( )

Destructor.

Definition at line 554 of file DFSTree_tpl.h.

554  {
555  GUM_DESTRUCTOR(DFSTree< GUM_SCALAR >::NeighborDegreeSort);
556  }

Member Function Documentation

template<typename GUM_SCALAR >
INLINE bool gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::operator() ( NodeId  i,
NodeId  j 
)

The operator used to sort stuff.

Definition at line 559 of file DFSTree_tpl.h.

References gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::g, gum::EdgeGraphPart::neighbours(), and gum::Set< Key, Alloc >::size().

560  {
561  return g.neighbours(i).size() < g.neighbours(j).size();
562  }
UndiGraph & g
The isomorphism graph.
Definition: DFSTree.h:254
const NodeSet & neighbours(const NodeId id) const
returns the set of edges adjacent to a given node
Size size() const noexcept
Returns the number of elements in the set.
Definition: set_tpl.h:701

+ Here is the call graph for this function:

Member Data Documentation

template<typename GUM_SCALAR>
UndiGraph& gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::g

The isomorphism graph.

Definition at line 254 of file DFSTree.h.

Referenced by gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::operator()().


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