gum::prm::gspan::InterfaceGraph< GUM_SCALAR > Class Template Reference

This class represent the interface graph of a given gum::prm::PRMSystem<GUM_SCALAR>. More...

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

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

Public Member Functions
	InterfaceGraph (const PRMSystem< GUM_SCALAR > &sys)
	Default constructor. More...
	InterfaceGraph (const InterfaceGraph &source)
	Copy constructor, proceeds with a shallow copy so for friends only. More...
InterfaceGraph &	operator= (const InterfaceGraph &source)
	Copy operator. More...
	~InterfaceGraph ()
	Destructor. More...
UndiGraph &	graph ()
	Returns the graph of this interface graph. More...
const UndiGraph &	graph () const
	Returns the graph of this interface graph. More...
Bijection< Idx, LabelData *> &	labels ()
	Returns the bijection between LabelData and their string representation. More...
const Bijection< Idx, LabelData *> &	labels () const
	Returns the bijection between LabelData and their string representation. More...
Size	size (const LabelData *l) const
	Returns the number of node or edges labelled by l. More...
Set< NodeData< GUM_SCALAR > *> &	nodes (const LabelData *l)
	Returns the set of nodes labelled by l. More...
const Set< NodeData< GUM_SCALAR > *> &	nodes (const LabelData *l) const
	Returns the set of nodes labelled by l. More...
Set< EdgeData< GUM_SCALAR > *> &	edges (const LabelData *l)
	Returns the set of nodes labelled by l. More...
const Set< EdgeData< GUM_SCALAR > *> &	edges (const LabelData *l) const
	Returns the set of nodes labelled by l. More...
LabelData *	label (Idx id)
	Returns a label given its id. More...
NodeId	id (const PRMInstance< GUM_SCALAR > &i) const
	Returns the id of i in this interface graph. More...
NodeId	id (const PRMInstance< GUM_SCALAR > *i) const
	Returns the id of i in this interface graph. More...
NodeData< GUM_SCALAR > &	node (const PRMInstance< GUM_SCALAR > *i)
	Returns data about a node. More...
const NodeData< GUM_SCALAR > &	node (const PRMInstance< GUM_SCALAR > *i) const
	Returns data about a node. More...
NodeData< GUM_SCALAR > &	node (NodeId id)
	Returns data about a node. More...
const NodeData< GUM_SCALAR > &	node (NodeId id) const
	Returns data about a node. More...
EdgeData< GUM_SCALAR > &	edge (NodeId u, NodeId v)
	Returns data about an edge. More...
const EdgeData< GUM_SCALAR > &	edge (NodeId u, NodeId v) const
	Returns data about an edge. More...

Friends
class	gum::prm::GSpan< GUM_SCALAR >

Detailed Description

template<typename GUM_SCALAR>
class gum::prm::gspan::InterfaceGraph< GUM_SCALAR >

This class represent the interface graph of a given gum::prm::PRMSystem<GUM_SCALAR>.

An interface graph is a labelled graph over the instances of a gum::prm::PRMSystem<GUM_SCALAR>, where there exists an edge between two instance i and j if and only if their shared interface is nonempty.

Labels assigned to edges and nodes in the interface graph are technically strings, however since we need a linear oder each label is assigned a unique id.

Definition at line 167 of file interfaceGraph.h.

Constructor & Destructor Documentation

InterfaceGraph() [1/2]

template<typename GUM_SCALAR >

gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph ( const PRMSystem< GUM_SCALAR > &  sys )

explicit

Default constructor.

Definition at line 99 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edges, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__graph, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__idMap, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodes, gum::UndiGraph::addEdge(), gum::NodeGraphPart::addNodeWithId(), gum::prm::PRMSystem< GUM_SCALAR >::begin(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edge(), gum::prm::PRMSystem< GUM_SCALAR >::end(), gum::EdgeGraphPart::existsEdge(), gum::prm::gspan::NodeData< GUM_SCALAR >::l, gum::prm::gspan::EdgeData< GUM_SCALAR >::l_u, gum::prm::gspan::EdgeData< GUM_SCALAR >::l_v, gum::prm::gspan::NodeData< GUM_SCALAR >::n, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node(), gum::prm::gspan::EdgeData< GUM_SCALAR >::u, and gum::prm::gspan::EdgeData< GUM_SCALAR >::v.

                                             :
          __sys(&sys),
          __labels(new Bijection< Idx, LabelData* >()), __counter(0),
          __erase_flag(true) {
        GUM_CONSTRUCTOR(InterfaceGraph);
        HashTable< std::string, LabelData* > label_map;

        // We need to add each instance in __graph
        for (auto iter = sys.begin(); iter != sys.end(); ++iter) {
          NodeData< GUM_SCALAR >* node = new NodeData< GUM_SCALAR >();
          node->n = iter.val();
          __label(node, label_map);
          __graph.addNodeWithId(iter.key());
          __idMap.insert(node->n, iter.key());
          __nodes.insert(iter.key(), node);
        }

        NodeData< GUM_SCALAR >* u = nullptr;
        NodeData< GUM_SCALAR >* v = nullptr;

        for (const auto& elt : __nodes) {
          NodeData< GUM_SCALAR >* data = elt.second;

          for (const auto chain : data->n->type().slotChains()) {
            for (const auto inst : data->n->getInstances(chain->id())) {
              u = (__nodes[__idMap[inst]]->l < data->l) ? __nodes[__idMap[inst]]
                                                        : data;
              v = (u != data) ? data : __nodes[__idMap[inst]];

              if (!__graph.existsEdge(__idMap[u->n], __idMap[v->n])) {
                EdgeData< GUM_SCALAR >* edge = new EdgeData< GUM_SCALAR >();
                edge->u = u->n;
                edge->l_u = u->l;
                edge->v = v->n;
                edge->l_v = v->l;
                __label(edge, label_map);
                __graph.addEdge(__idMap[u->n], __idMap[v->n]);
                __edges.insert(Edge(__idMap[u->n], __idMap[v->n]), edge);
              }
            }
          }
        }
      }

Here is the call graph for this function:

InterfaceGraph() [2/2]

template<typename GUM_SCALAR >

gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph

(

const InterfaceGraph< GUM_SCALAR > &

source

)

Copy constructor, proceeds with a shallow copy so for friends only.

Definition at line 145 of file interfaceGraph_tpl.h.

                                                     :
          __sys(source.__sys),
          __graph(source.__graph), __nodes(source.__nodes),
          __idMap(source.__idMap), __edges(source.__edges),
          __labels(new Bijection< Idx, LabelData* >(*(source.__labels))),
          __nodeMap(source.__nodeMap), __edgeMap(source.__edgeMap),
          __counter(source.__counter), __erase_flag(false) {
        GUM_CONS_CPY(InterfaceGraph);
      }

~InterfaceGraph()

template<typename GUM_SCALAR >

gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::~InterfaceGraph

(

)

Destructor.

Definition at line 157 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edgeMap, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edges, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__erase_flag, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__labels, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodeMap, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodes, and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::operator=().

                                                    {
        GUM_DESTRUCTOR(InterfaceGraph);

        if (__erase_flag) {
          for (const auto& elt : __nodes)
            delete elt.second;

          for (const auto& elt : __edges)
            delete elt.second;

          for (const auto& elt : __nodeMap) {
            delete elt.first;
            delete elt.second;
          }

          for (const auto& elt : __edgeMap) {
            delete elt.first;
            delete elt.second;
          }
        }

        delete __labels;
      }

Here is the call graph for this function:

Member Function Documentation

__label() [1/2]

template<typename GUM_SCALAR >

void gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label ( NodeData< GUM_SCALAR > *  node, HashTable< std::string, LabelData * > &  label_map  )

private

Compute the label of node and add it to __labels if it does not exists yet. Update node with the correct label's id.

Definition at line 188 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__counter, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__labels, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodeMap, gum::HashTable< Key, Val, Alloc >::exists(), gum::prm::gspan::LabelData::id, gum::HashTable< Key, Val, Alloc >::insert(), gum::prm::gspan::LabelData::l, gum::prm::gspan::NodeData< GUM_SCALAR >::l, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::label(), gum::prm::gspan::NodeData< GUM_SCALAR >::n, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::size(), and gum::prm::gspan::LabelData::tree_width.

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

                                                        {
        Size              size = Size(1);
        std::stringstream sBuff;
        sBuff << node->n->type().name();

        // First we search for multiple inputs
        for (const auto chain : node->n->type().slotChains()) {
          if (chain->isMultiple()) {
            sBuff << "-" << node->n->getInstances(chain->id()).size();
            sBuff << chain->name();
            size *= node->n->getInstances(chain->id()).size()
                    * chain->lastElt().type().variable().domainSize();
          } else {
            size *= chain->lastElt().type().variable().domainSize();
          }
        }

        // Second we search for active outputs
        for (const auto nn : node->n->type().containerDag().nodes()) {
          if (node->n->type().isOutputNode(node->n->type().get(nn))) {
            try {
              sBuff << "-" << node->n->getRefAttr(nn).size()
                    << node->n->get(nn).name();
              size *= node->n->get(nn).type().variable().domainSize();
            } catch (NotFound&) {
              // (nn) is an inactive output node
            }
          }
        }

        // Label is ready
        if (!label_map.exists(sBuff.str())) {
          LabelData* label = new LabelData();
          label_map.insert(sBuff.str(), label);
          label->id = ++__counter;
          label->tree_width = size;
          label->l = sBuff.str();
          __labels->insert(label->id, label);
          __nodeMap.insert(label, new Set< NodeData< GUM_SCALAR >* >());
        }

        node->l = label_map[sBuff.str()];
        __nodeMap[node->l]->insert(node);
      }

Here is the call graph for this function:

Here is the caller graph for this function:

__label() [2/2]

template<typename GUM_SCALAR >

void gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label ( EdgeData< GUM_SCALAR > *  edge, HashTable< std::string, LabelData * > &  label_map  )

private

Compute the label of edge and add it to __labels if it does not exists yet. Update edge with the correct label's id.

Definition at line 236 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__counter, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edgeMap, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__labels, gum::HashTable< Key, Val, Alloc >::exists(), gum::prm::gspan::LabelData::id, gum::HashTable< Key, Val, Alloc >::insert(), gum::prm::gspan::LabelData::l, gum::prm::gspan::EdgeData< GUM_SCALAR >::l, gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::label(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::size(), gum::prm::gspan::LabelData::tree_width, gum::prm::gspan::EdgeData< GUM_SCALAR >::u, and gum::prm::gspan::EdgeData< GUM_SCALAR >::v.

                                                        {
        Size              size = Size(1);
        std::stringstream sBuff;
        sBuff << edge->u->type().name() << "-" << edge->v->type().name();

        // First looking for edge->u output nodes in v
        for (const auto chain : edge->u->type().slotChains()) {
          if (edge->u->getInstances(chain->id()).exists(edge->v)) {
            sBuff << "-" << edge->v->type().name() << "."
                  << chain->lastElt().name();
            size *= chain->lastElt().type().variable().domainSize();
          }
        }

        // Second looking for edge->v output nodes in u
        for (const auto chain : edge->v->type().slotChains())
          if (edge->v->getInstances(chain->id()).exists(edge->u)) {
            sBuff << "-" << edge->u->type().name() << "."
                  << chain->lastElt().name();
            size *= chain->lastElt().type().variable().domainSize();
          }

        // Label is ready
        if (!label_map.exists(sBuff.str())) {
          LabelData* label = new LabelData();
          label_map.insert(sBuff.str(), label);
          label->id = ++__counter;
          label->l = sBuff.str();
          label->tree_width = size;
          __labels->insert(label->id, label);
          __edgeMap.insert(label, new Set< EdgeData< GUM_SCALAR >* >());
        }

        edge->l = label_map[sBuff.str()];
        __edgeMap[edge->l]->insert(edge);
      }

Here is the call graph for this function:

edge() [1/2]

template<typename GUM_SCALAR >

INLINE EdgeData< GUM_SCALAR > & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edge	(	NodeId	u,
		NodeId	v
	)

Returns data about an edge.

Exceptions

NotFound

Definition at line 371 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edges.

Referenced by gum::prm::GSpan< GUM_SCALAR >::__subgraph_mining(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph().

                                                                                  {
        try {
          return *(__edges[Edge(u, v)]);
        } catch (NotFound&) { return *(__edges[Edge(v, u)]); }
      }

Here is the caller graph for this function:

edge() [2/2]

template<typename GUM_SCALAR >

INLINE const EdgeData< GUM_SCALAR > & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edge	(	NodeId	u,
		NodeId	v
	)		const

Returns data about an edge.

Exceptions

NotFound

Definition at line 380 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edges.

                                                                              {
        try {
          return *(__edges[Edge(u, v)]);
        } catch (NotFound&) { return *(__edges[Edge(v, u)]); }
      }

edges() [1/2]

template<typename GUM_SCALAR >

INLINE Set< EdgeData< GUM_SCALAR > *> & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edges

(

const LabelData *

l

)

Returns the set of nodes labelled by l.

Definition at line 319 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edgeMap.

                                                                   {
        return *(__edgeMap[const_cast< LabelData* >(l)]);
      }

edges() [2/2]

template<typename GUM_SCALAR >

INLINE const Set< EdgeData< GUM_SCALAR > *> & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edges

(

const LabelData *

l

)

const

Returns the set of nodes labelled by l.

Definition at line 325 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edgeMap.

                                                                               {
        return *(__edgeMap[const_cast< LabelData* >(l)]);
      }

graph() [1/2]

template<typename GUM_SCALAR >

INLINE UndiGraph & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::graph

(

)

Returns the graph of this interface graph.

Definition at line 276 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__graph.

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

                                                            {
        return __graph;
      }

Here is the caller graph for this function:

graph() [2/2]

template<typename GUM_SCALAR >

INLINE const UndiGraph & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::graph

(

)

const

Returns the graph of this interface graph.

Definition at line 281 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__graph.

                                                                        {
        return __graph;
      }

id() [1/2]

template<typename GUM_SCALAR >

INLINE NodeId gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::id

(

const PRMInstance< GUM_SCALAR > &

i

)

const

Returns the id of i in this interface graph.

Definition at line 335 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__idMap.

Referenced by gum::prm::GSpan< GUM_SCALAR >::__subgraph_mining(), gum::prm::GSpan< GUM_SCALAR >::discoverPatterns(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node().

                                                   {
        return __idMap[const_cast< PRMInstance< GUM_SCALAR >* >(&i)];
      }

Here is the caller graph for this function:

id() [2/2]

template<typename GUM_SCALAR >

INLINE NodeId gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::id

(

const PRMInstance< GUM_SCALAR > *

i

)

const

Returns the id of i in this interface graph.

Definition at line 341 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__idMap.

                                                   {
        return __idMap[const_cast< PRMInstance< GUM_SCALAR >* >(i)];
      }

label()

template<typename GUM_SCALAR >

INLINE LabelData * gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::label

(

Idx

id

)

Returns a label given its id.

Definition at line 330 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__labels.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label().

                                                                  {
        return __labels->second(id);
      }

Here is the caller graph for this function:

labels() [1/2]

template<typename GUM_SCALAR >

INLINE Bijection< Idx, LabelData *> & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::labels

(

)

Returns the bijection between LabelData and their string representation.

Definition at line 286 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__labels.

                                                                                {
        return *__labels;
      }

labels() [2/2]

template<typename GUM_SCALAR >

INLINE const Bijection< Idx, LabelData *> & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::labels

(

)

const

Returns the bijection between LabelData and their string representation.

Definition at line 292 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__labels.

                                                              {
        return *__labels;
      }

node() [1/4]

template<typename GUM_SCALAR >

INLINE NodeData< GUM_SCALAR > & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node

(

const PRMInstance< GUM_SCALAR > *

i

)

Returns data about a node.

Exceptions

NotFound

Definition at line 348 of file interfaceGraph_tpl.h.

Referenced by gum::prm::GSpan< GUM_SCALAR >::__subgraph_mining(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node().

                                                                                  {
        return node(id(i));
      }

Here is the caller graph for this function:

node() [2/4]

template<typename GUM_SCALAR >

INLINE const NodeData< GUM_SCALAR > & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node

(

const PRMInstance< GUM_SCALAR > *

i

)

const

Returns data about a node.

Exceptions

NotFound

Definition at line 353 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node().

                                                   {
        return node(id(i));
      }

Here is the call graph for this function:

node() [3/4]

template<typename GUM_SCALAR >

INLINE NodeData< GUM_SCALAR > & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node

(

NodeId

id

)

Returns data about a node.

Exceptions

NotFound

Definition at line 360 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodes, and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::id().

                                                         {
        return *(__nodes[id]);
      }

Here is the call graph for this function:

node() [4/4]

template<typename GUM_SCALAR >

INLINE const NodeData< GUM_SCALAR > & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node

(

NodeId

id

)

const

Returns data about a node.

Exceptions

NotFound

Definition at line 366 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodes, and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::id().

                                                                     {
        return *(__nodes[id]);
      }

Here is the call graph for this function:

nodes() [1/2]

template<typename GUM_SCALAR >

INLINE Set< NodeData< GUM_SCALAR > *> & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::nodes

(

const LabelData *

l

)

Returns the set of nodes labelled by l.

Definition at line 307 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodeMap.

                                                                   {
        return *(__nodeMap[const_cast< LabelData* >(l)]);
      }

nodes() [2/2]

template<typename GUM_SCALAR >

INLINE const Set< NodeData< GUM_SCALAR > *> & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::nodes

(

const LabelData *

l

)

const

Returns the set of nodes labelled by l.

Definition at line 313 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodeMap.

                                                                               {
        return *(__nodeMap[const_cast< LabelData* >(l)]);
      }

operator=()

template<typename GUM_SCALAR >

InterfaceGraph< GUM_SCALAR > & gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::operator=

(

const InterfaceGraph< GUM_SCALAR > &

source

)

Copy operator.

Definition at line 183 of file interfaceGraph_tpl.h.

References GUM_ERROR.

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

                                                                                          {
        GUM_ERROR(FatalError, "not implemented");
      }

Here is the caller graph for this function:

size()

template<typename GUM_SCALAR >

INLINE Size gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::size

(

const LabelData *

l

)

const

Returns the number of node or edges labelled by l.

Definition at line 297 of file interfaceGraph_tpl.h.

References gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edgeMap, and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodeMap.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label().

                                                                             {
        try {
          return __nodeMap[const_cast< LabelData* >(l)]->size();
        } catch (NotFound&) {
          return __edgeMap[const_cast< LabelData* >(l)]->size();
        }
      }

Here is the caller graph for this function:

Friends And Related Function Documentation

gum::prm::GSpan< GUM_SCALAR >

template<typename GUM_SCALAR>

friend class gum::prm::GSpan< GUM_SCALAR >

friend

Definition at line 168 of file interfaceGraph.h.

Member Data Documentation

__counter

template<typename GUM_SCALAR>

Idx gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__counter

private

A counter used of assigning ids to labels.

Definition at line 277 of file interfaceGraph.h.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label().

__edgeMap

template<typename GUM_SCALAR>

HashTable< LabelData*, Set< EdgeData< GUM_SCALAR >* >* > gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edgeMap

private

Mapping between a LabelData and the set of EdgeData<GUM_SCALAR> with that label.

Definition at line 274 of file interfaceGraph.h.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edges(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::size(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::~InterfaceGraph().

__edges

template<typename GUM_SCALAR>

EdgeProperty< EdgeData< GUM_SCALAR >* > gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__edges

private

Data associated with edges in __graph.

Definition at line 261 of file interfaceGraph.h.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edge(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::~InterfaceGraph().

__erase_flag

template<typename GUM_SCALAR>

bool gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__erase_flag

private

For shallow copies.

Definition at line 280 of file interfaceGraph.h.

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

__graph

template<typename GUM_SCALAR>

UndiGraph gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__graph

private

The interface graph.

Definition at line 252 of file interfaceGraph.h.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::graph(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph().

__idMap

template<typename GUM_SCALAR>

HashTable< PRMInstance< GUM_SCALAR >*, NodeId > gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__idMap

private

Mapping between PRMInstance<GUM_SCALAR> dans their id in __graph.

Definition at line 258 of file interfaceGraph.h.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::id(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph().

__labels

template<typename GUM_SCALAR>

Bijection< Idx, LabelData* >* gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__labels

private

Bijection between labels and their ids.

Definition at line 264 of file interfaceGraph.h.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::label(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::labels(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::~InterfaceGraph().

__nodeMap

template<typename GUM_SCALAR>

HashTable< LabelData*, Set< NodeData< GUM_SCALAR >* >* > gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodeMap

private

Mapping between a LabelData and the set of NodeData<GUM_SCALAR> with that label.

Definition at line 269 of file interfaceGraph.h.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::nodes(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::size(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::~InterfaceGraph().

__nodes

template<typename GUM_SCALAR>

NodeProperty< NodeData< GUM_SCALAR >* > gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__nodes

private

Data associated with a node in __graph.

Definition at line 255 of file interfaceGraph.h.

Referenced by gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node(), and gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::~InterfaceGraph().

__sys

template<typename GUM_SCALAR>

const PRMSystem< GUM_SCALAR >* gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__sys

private

The gum::prm::PRMSystem<GUM_SCALAR> represented by this interface graph.

Definition at line 249 of file interfaceGraph.h.

---

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

• agrum/PRM/gspan/interfaceGraph.h
• agrum/PRM/gspan/interfaceGraph_tpl.h