gum::DiGraph Class Reference

Base class for all oriented graphs. More...

#include <diGraph.h>

Inheritance diagram for gum::DiGraph:

Collaboration diagram for gum::DiGraph:

Public Attributes
Signaler1< NodeId >	onNodeAdded
Signaler1< NodeId >	onNodeDeleted
Signaler2< NodeId, NodeId >	onArcAdded
Signaler2< NodeId, NodeId >	onArcDeleted

Public Member Functions
bool	hasDirectedPath (const NodeId from, const NodeId to)
	checks whether there exists a directed path from from to to More...
Constructors / Destructors
	DiGraph (Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true)
	default constructor More...
	DiGraph (const DiGraph &g)
	copy constructor More...
virtual	~DiGraph ()
	destructor More...
Operators
DiGraph &	operator= (const DiGraph &g)
	copy operator More...
bool	operator== (const DiGraph &g) const
	tests whether two DiGraphs are identical (same nodes, same arcs) More...
bool	operator!= (const DiGraph &g) const
	tests whether two DiGraphs are different More...
Accessors/Modifiers
virtual void	addArc (const NodeId tail, const NodeId head)
	insert a new arc into the directed graph More...
virtual void	eraseNode (const NodeId id)
	remove a node and its adjacent arcs from the graph More...
virtual void	clear ()
	removes all the nodes and arcs from the graph More...
virtual std::string	toString () const
	to friendly display the content of the graph More...
virtual std::string	toDot () const
	to friendly display the content of the graph in the DOT syntax More...
const Sequence< NodeId > &	topologicalOrder (bool clear=true) const
	The topological order stays the same as long as no variable or arcs are added or erased src the topology. More...
Operators
bool	operator== (const NodeGraphPart &p) const
	check whether two NodeGraphParts contain the same nodes More...
bool	operator!= (const NodeGraphPart &p) const
	check whether two NodeGraphParts contain different nodes More...
Accessors/Modifiers
void	populateNodes (const NodeGraphPart &s)
	populateNodes clears *this and fills it with the same nodes as "s" More...
template<typename T >
void	populateNodesFromProperty (const NodeProperty< T > &h)
	populateNodesFromProperty clears *this and fills it with the keys of "h" More...
NodeId	nextNodeId () const
	returns a new node id, not yet used by any node More...
virtual NodeId	addNode ()
	insert a new node and return its id More...
std::vector< NodeId >	addNodes (Size n)
	insert n nodes More...
virtual void	addNodeWithId (const NodeId id)
	try to insert a node with the given id More...
bool	existsNode (const NodeId id) const
	returns true iff the NodeGraphPart contains the given nodeId More...
bool	exists (const NodeId id) const
	alias for existsNode More...
bool	emptyNodes () const
	indicates whether there exists nodes in the NodeGraphPart More...
bool	empty () const
	alias for emptyNodes More...
virtual void	clearNodes ()
	remove all the nodes from the NodeGraphPart More...
Size	sizeNodes () const
	returns the number of nodes in the NodeGraphPart More...
Size	size () const
	alias for sizeNodes More...
NodeId	bound () const
	returns a number n such that all node ids are strictly lower than n More...
NodeSet	asNodeSet () const
	returns a copy of the set of nodes represented by the NodeGraphPart More...
const NodeGraphPart &	nodes () const
	return *this as a NodeGraphPart More...
node_iterator_safe	beginSafe () const
	a begin iterator to parse the set of nodes contained in the NodeGraphPart More...
const node_iterator_safe &	endSafe () const noexcept
	the end iterator to parse the set of nodes contained in the NodeGraphPart More...
node_iterator	begin () const noexcept
	a begin iterator to parse the set of nodes contained in the NodeGraphPart More...
const node_iterator &	end () const noexcept
	the end iterator to parse the set of nodes contained in the NodeGraphPart More...
template<typename VAL >
NodeProperty< VAL >	nodesProperty (VAL(*f)(const NodeId &), Size size=0) const
	a method to create a HashTable with key:NodeId and value:VAL More...
template<typename VAL >
NodeProperty< VAL >	nodesProperty (const VAL &a, Size size=0) const
	a method to create a hashMap with key:NodeId and value:VAL More...
template<typename VAL >
List< VAL >	listMapNodes (VAL(*f)(const NodeId &)) const
	a method to create a list of VAL from a set of nodes (using for every nodee, say x, the VAL f(x)) More...
Operators
bool	operator== (const ArcGraphPart &p) const
	tests whether two ArcGraphParts contain the same arcs More...
bool	operator!= (const ArcGraphPart &p) const
	tests whether two ArcGraphParts contain different arcs More...
Accessors/Modifiers
virtual void	eraseArc (const Arc &arc)
	removes an arc from the ArcGraphPart More...
bool	existsArc (const Arc &arc) const
	indicates whether a given arc exists More...
bool	existsArc (NodeId tail, NodeId head) const
	indicates whether a given arc exists More...
bool	emptyArcs () const
	indicates wether the ArcGraphPart contains any arc More...
void	clearArcs ()
	removes all the arcs from the ArcGraphPart More...
Size	sizeArcs () const
	indicates the number of arcs stored within the ArcGraphPart More...
const ArcSet &	arcs () const
	returns the set of arcs stored within the ArcGraphPart More...
const NodeSet &	parents (NodeId id) const
	returns the set of nodes with arc ingoing to a given node More...
NodeSet	parents (const NodeSet &ids) const
	returns the set of parents of a set of nodes More...
NodeSet	family (NodeId id) const
	returns the set of nodes which consists in the node and its parents More...
NodeSet	family (const NodeSet &ids) const
	returns the set of family nodes of a set of nodes More...
NodeSet	descendants (NodeId id) const
	returns the set of nodes with directed path outgoing from a given node More...
NodeSet	ancestors (NodeId id) const
	returns the set of nodes with directed path ingoing to a given node More...
NodeSet	children (const NodeSet &ids) const
	returns the set of children of a set of nodes More...
const NodeSet &	children (NodeId id) const
	returns the set of nodes with arc outgoing from a given node More...
void	eraseParents (NodeId id)
	erase all the parents of a given node More...
void	unvirtualizedEraseParents (NodeId id)
	same function as eraseParents but without any virtual call to an erase More...
void	eraseChildren (NodeId id)
	removes all the children of a given node More...
void	unvirtualizedEraseChildren (NodeId id)
	same function as eraseChildren but without any virtual call to an erase More...
template<typename VAL >
ArcProperty< VAL >	arcsProperty (VAL(*f)(const Arc &), Size size=0) const
	a method to create a hashMap of VAL from a set of arcs (using for every arc, say x, the VAL f(x)) More...
template<typename VAL >
ArcProperty< VAL >	arcsProperty (const VAL &a, Size size=0) const
	a method to create a hashMap of VAL from a set of arcs (using for every arc, say x, the VAL a) More...
template<typename VAL >
List< VAL >	listMapArcs (VAL(*f)(const Arc &)) const
	a method to create a list of VAL from a set of arcs (using for every arc, say x, the VAL f(x)) More...
std::vector< NodeId >	directedPath (NodeId node1, NodeId node2) const
	returns a directed path from node1 to node2 belonging to the set of arcs More...
std::vector< NodeId >	directedUnorientedPath (NodeId node1, NodeId node2) const
	returns an unoriented (directed) path from node1 to node2 in the arc set More...

Public Types
typedef NodeGraphPartIterator	NodeIterator
typedef NodeGraphPartIterator	NodeConstIterator
typedef NodeGraphPartIteratorSafe	NodeIteratorSafe
typedef NodeGraphPartIteratorSafe	NodeConstIteratorSafe
typedef ArcSetIterator	ArcIterator
using	node_iterator = NodeGraphPartIterator
	types for STL compliance More...
using	node_const_iterator = NodeGraphPartIterator
	types for STL compliance More...
using	node_iterator_safe = NodeGraphPartIteratorSafe
	types for STL compliance More...
using	node_const_iterator_safe = NodeGraphPartIteratorSafe
	types for STL compliance More...

Protected Member Functions
void	eraseSetOfArcs_ (const ArcSet &set)
	a (virtualized) function to remove a given set of arcs More...
void	unvirtualizedEraseSetOfArcs_ (const ArcSet &set)
	similar to eraseSetOfArcs_ except that it is unvirtualized More...

Detailed Description

Base class for all oriented graphs.

This is the base class for graphs containing directed edges (so-called arcs)

• Usage example:

  // creating empty graphs
  DiGraph g1,g2;
  
  // adding nodes and arcs to g1
  NodeId i1=g1.addNode();
  NodeId i2=g1.addNode();
  NodeId i3=g1.addNode();
  g1.addArc( i1,i2 );
  g1.addArc( i1,i3 );
  g1.addArc( i2,i3 );
  
  //throw an InvalidNode
  // g1.addArc( i1+i2+i3,i1 );
  
  // copying graphs
  DiGraph g3 = g1;
  g2 = g1;
  DiGraph g4=g1;
  
  // check if a graph has no node
  if ( g1.empty() ) cerr << "graph g1 is empty" << endl;
  
  // remove all the nodes (as well as their adjacent arcs)
  g1.clear();
  
  // remove some arc
  g4.eraseArc( Arc ( i1,i3 ) );
  
  // remove node
  g2.eraseNode( i2 );
  
  // parse a graph
  for ( const auto node : g3.nodes() )
    cerr << node<< endl;
  
  for ( const auto & arc : g3.arcs())
    cerr << arc << endl;
  
  const ArcSet& a=g3.parents( 3 );
  
  for ( const auto & par : g3.parents(3))
    cerr << "  -  "<< par;
  
  cerr<<endl;
  
  // remove all the arcs that are parent of a given node
  g3.eraseParents( 2 );

Definition at line 110 of file diGraph.h.

Member Typedef Documentation

ArcIterator

typedef ArcSetIterator gum::ArcGraphPart::ArcIterator

inherited

Definition at line 80 of file arcGraphPart.h.

node_const_iterator

using gum::NodeGraphPart::node_const_iterator = NodeGraphPartIterator

inherited

types for STL compliance

Definition at line 258 of file nodeGraphPart.h.

node_const_iterator_safe

using gum::NodeGraphPart::node_const_iterator_safe = NodeGraphPartIteratorSafe

inherited

types for STL compliance

Definition at line 260 of file nodeGraphPart.h.

node_iterator

using gum::NodeGraphPart::node_iterator = NodeGraphPartIterator

inherited

types for STL compliance

Definition at line 257 of file nodeGraphPart.h.

node_iterator_safe

using gum::NodeGraphPart::node_iterator_safe = NodeGraphPartIteratorSafe

inherited

types for STL compliance

Definition at line 259 of file nodeGraphPart.h.

NodeConstIterator

typedef NodeGraphPartIterator gum::NodeGraphPart::NodeConstIterator

inherited

Definition at line 267 of file nodeGraphPart.h.

NodeConstIteratorSafe

typedef NodeGraphPartIteratorSafe gum::NodeGraphPart::NodeConstIteratorSafe

inherited

Definition at line 269 of file nodeGraphPart.h.

NodeIterator

typedef NodeGraphPartIterator gum::NodeGraphPart::NodeIterator

inherited

Definition at line 266 of file nodeGraphPart.h.

NodeIteratorSafe

typedef NodeGraphPartIteratorSafe gum::NodeGraphPart::NodeIteratorSafe

inherited

Definition at line 268 of file nodeGraphPart.h.

Constructor & Destructor Documentation

DiGraph() [1/2]

gum::DiGraph::DiGraph ( Size  nodes_size = HashTableConst::default_size, bool  nodes_resize_policy = true, Size  arcs_size = HashTableConst::default_size, bool  arcs_resize_policy = true  )

explicit

default constructor

Parameters

nodes_size	the size of the hash table used to store all the nodes
nodes_resize_policy	the resizing policy of this hash table
arcs_size	the size of the hash table used to store all the arcs
arcs_resize_policy	the resizing policy of this hash table

Definition at line 36 of file diGraph.cpp.

References gum::Set< Key, Alloc >::emplace().

                                            :
      NodeGraphPart(nodes_size, nodes_resize_policy),
      ArcGraphPart(arcs_size, arcs_resize_policy),
      mutableTopologicalOrder__(nullptr) {
    GUM_CONSTRUCTOR(DiGraph);
  }

Here is the call graph for this function:

DiGraph() [2/2]

gum::DiGraph::DiGraph

(

const DiGraph &

g

)

copy constructor

Parameters

g	the DiGraph to copy

Definition at line 46 of file diGraph.cpp.

References gum::Set< Key, Alloc >::emplace().

                                   :
      NodeGraphPart(g), ArcGraphPart(g), mutableTopologicalOrder__(nullptr) {
    GUM_CONS_CPY(DiGraph);
    if (g.mutableTopologicalOrder__ != nullptr) {
      mutableTopologicalOrder__
         = new Sequence< NodeId >(*(g.mutableTopologicalOrder__));
    }
  }

Here is the call graph for this function:

~DiGraph()

gum::DiGraph::~DiGraph ( )

virtual

destructor

Definition at line 55 of file diGraph.cpp.

References gum::Set< Key, Alloc >::emplace().

                    {
    GUM_DESTRUCTOR(DiGraph);
    if (mutableTopologicalOrder__ != nullptr) { delete mutableTopologicalOrder__; }
  }

Here is the call graph for this function:

Member Function Documentation

addArc()

INLINE void gum::DiGraph::addArc ( const NodeId  tail, const NodeId  head  )

virtual

insert a new arc into the directed graph

Parameters

tail	the id of the tail of the new inserted arc
head	the id of the head of the new inserted arc

Warning

if the arc already exists, nothing is done. In particular, no exception is raised.

Exceptions

InvalidNode

if head or tail does not belong to the graph nodes

Reimplemented from gum::ArcGraphPart.

Reimplemented in gum::DAG.

Definition at line 34 of file diGraph_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                  {
    if (!exists(head)) { GUM_ERROR(InvalidNode, "no head node : " << head); }

    if (!exists(tail)) { GUM_ERROR(InvalidNode, "no tail node : " << tail); }

    ArcGraphPart::addArc(tail, head);
  }

Here is the call graph for this function:

addNode()

INLINE NodeId gum::NodeGraphPart::addNode ( )

virtualinherited

insert a new node and return its id

Returns

the id chosen by the internal idFactory

Reimplemented in gum::CliqueGraph.

Definition at line 252 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                       {
    NodeId newNode;

    // fill the first hole if holes exist
    if (holes__ && (!holes__->empty())) {
      newNode = *(holes__->begin());
      eraseHole__(newNode);
    } else {
      newNode = boundVal__;
      ++boundVal__;
      updateEndIteratorSafe__();
    }

    GUM_EMIT1(onNodeAdded, newNode);

    return newNode;
  }

Here is the call graph for this function:

addNodes()

INLINE std::vector< NodeId > gum::NodeGraphPart::addNodes ( Size  n )

inherited

insert n nodes

Parameters

n	the number of nodes to add

Returns

the vector of chosen ids

Definition at line 270 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                           {
    std::vector< NodeId > v;
    v.reserve(N);
    for (Idx i = 0; i < N; i++)
      v.push_back(this->addNode());
    return v;
  }

Here is the call graph for this function:

addNodeWithId()

void gum::NodeGraphPart::addNodeWithId ( const NodeId  id )

virtualinherited

try to insert a node with the given id

Warning

This method should be carefully used. Please prefer populateNodes or populateNodesFromProperty when possible

Exceptions

DuplicateElement

exception if the id already exists

Definition at line 131 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                   {
    if (id >= boundVal__) {
      if (id > boundVal__) {   // we have to add holes
        if (!holes__) holes__ = new NodeSet(holes_size__, holes_resize_policy__);

        for (NodeId i = boundVal__; i < id; ++i)
          holes__->insert(i);
      }

      boundVal__ = id + 1;

      updateEndIteratorSafe__();
    } else {
      if (inHoles__(id)) {   // we fill a hole
        eraseHole__(id);
      } else {
        GUM_ERROR(DuplicateElement, "Id " << id << " is already used");
      }
    }

    GUM_EMIT1(onNodeAdded, id);
  }

Here is the call graph for this function:

ancestors()

NodeSet gum::ArcGraphPart::ancestors ( NodeId  id ) const

inherited

returns the set of nodes with directed path ingoing to a given node

Note that the set of nodes returned may be empty if no path within the ArcGraphPart is ingoing to the given node.

Parameters

id	the node which is the head of a directed path with the returned nodes

Definition at line 172 of file arcGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                 {
    NodeSet res;
    NodeSet tmp;
    for (auto next: parents(id))
      tmp.insert(next);

    while (!tmp.empty()) {
      auto current = *(tmp.begin());
      tmp.erase(current);
      res.insert(current);
      for (auto next: parents(current)) {
        if (!tmp.contains(next) && !res.contains(next)) { tmp.insert(next); }
      }
    }
    return res;
  }

Here is the call graph for this function:

arcs()

INLINE const ArcSet & gum::ArcGraphPart::arcs ( ) const

inherited

returns the set of arcs stored within the ArcGraphPart

Definition at line 38 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return arcs__; }

Here is the call graph for this function:

arcsProperty() [1/2]

template<typename VAL >

ArcProperty< VAL > gum::ArcGraphPart::arcsProperty ( VAL(*)(const Arc &)  f, Size  size = 0  ) const

inherited

a method to create a hashMap of VAL from a set of arcs (using for every arc, say x, the VAL f(x))

Parameters

f	a function assigning a VAL to any arc
size	an optional parameter enabling to fine-tune the returned Property. Roughly speaking, it is a good practice to have a size equal to half the number of arcs. If you do not specify this parameter, the method will assign it for you.

arcsProperty() [2/2]

template<typename VAL >

ArcProperty< VAL > gum::ArcGraphPart::arcsProperty ( const VAL &  a, Size  size = 0  ) const

inherited

a method to create a hashMap of VAL from a set of arcs (using for every arc, say x, the VAL a)

Parameters

a	the default value assigned to each arc in the returned Property
size	an optional parameter enabling to fine-tune the returned Property. Roughly speaking, it is a good practice to have a size equal to half the number of arcs. If you do not specify this parameter, the method will assign it for you.

asNodeSet()

INLINE NodeSet gum::NodeGraphPart::asNodeSet ( ) const

inherited

returns a copy of the set of nodes represented by the NodeGraphPart

Warning

this function is o(n) where n is the number of nodes. In space and in time. Usually, when you need to parse the nodes of a NodeGraphPart, prefer using

for(const auto n : nodes()) 

rather than

for(const auto n : asNodeSet()) 

as this is faster and consumes much less memory.

Definition at line 360 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                {
    NodeSet son(sizeNodes());

    if (!empty()) {
      for (NodeId n = 0; n < boundVal__; ++n) {
        if (!inHoles__(n)) son.insert(n);
      }
    }

    return son;
  }

Here is the call graph for this function:

begin()

INLINE NodeGraphPartIterator gum::NodeGraphPart::begin ( ) const

noexceptinherited

a begin iterator to parse the set of nodes contained in the NodeGraphPart

Definition at line 332 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                   {
    NodeGraphPartIterator it(*this);
    it.validate_();   // stop the iterator at the first not-in-holes
    return it;
  }

Here is the call graph for this function:

beginSafe()

INLINE NodeGraphPartIteratorSafe gum::NodeGraphPart::beginSafe ( ) const

inherited

a begin iterator to parse the set of nodes contained in the NodeGraphPart

Definition at line 318 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                  {
    NodeGraphPartIteratorSafe it(*this);
    it.validate_();   // stop the iterator at the first not-in-holes
    return it;
  }

Here is the call graph for this function:

bound()

INLINE NodeId gum::NodeGraphPart::bound ( ) const

inherited

returns a number n such that all node ids are strictly lower than n

Definition at line 307 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return boundVal__; }

Here is the call graph for this function:

children() [1/2]

INLINE NodeSet gum::ArcGraphPart::children ( const NodeSet &  ids ) const

inherited

returns the set of children of a set of nodes

Definition at line 68 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                {
    NodeSet res;
    for (const auto node: ids)
      res += children(node);
    return res;
  }

Here is the call graph for this function:

children() [2/2]

INLINE const NodeSet & gum::ArcGraphPart::children ( NodeId  id ) const

inherited

returns the set of nodes with arc outgoing from a given node

Note that the set of arcs returned may be empty if no arc within the ArcGraphPart is outgoing from the given node.

Parameters

id	the node which is the tail of the arcs returned

Definition at line 91 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                              {
    checkChildren__(id);
    return *(children__[id]);
  }

Here is the call graph for this function:

clear()

INLINE void gum::DiGraph::clear ( )

virtual

removes all the nodes and arcs from the graph

Reimplemented from gum::NodeGraphPart.

Reimplemented in gum::MixedGraph.

Definition at line 42 of file diGraph_inl.h.

References gum::Set< Key, Alloc >::emplace().

                             {
    ArcGraphPart::clearArcs();
    NodeGraphPart::clearNodes();
  }

Here is the call graph for this function:

clearArcs()

void gum::ArcGraphPart::clearArcs ( )

inherited

removes all the arcs from the ArcGraphPart

Definition at line 78 of file arcGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

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

    parents__.clear();

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

    children__.clear();

    // we need this copy only if at least one onArcDeleted listener exists
    if (onArcDeleted.hasListener()) {
      ArcSet tmp = arcs__;
      arcs__.clear();

      for (const auto& arc: tmp)
        GUM_EMIT2(onArcDeleted, arc.tail(), arc.head());
    } else {
      arcs__.clear();
    }
  }

Here is the call graph for this function:

clearNodes()

INLINE void gum::NodeGraphPart::clearNodes ( )

virtualinherited

remove all the nodes from the NodeGraphPart

Definition at line 309 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ clearNodes__(); }

Here is the call graph for this function:

descendants()

NodeSet gum::ArcGraphPart::descendants ( NodeId  id ) const

inherited

returns the set of nodes with directed path outgoing from a given node

Note that the set of nodes returned may be empty if no path within the ArcGraphPart is outgoing from the given node.

Parameters

id	the node which is the tail of a directed path with the returned nodes

Definition at line 154 of file arcGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                   {
    NodeSet res;
    NodeSet tmp;
    for (auto next: children(id))
      tmp.insert(next);

    while (!tmp.empty()) {
      auto current = *(tmp.begin());
      tmp.erase(current);
      res.insert(current);
      for (auto next: children(current)) {
        if (!tmp.contains(next) && !res.contains(next)) { tmp.insert(next); }
      }
    }
    return res;
  }

Here is the call graph for this function:

directedPath()

std::vector< NodeId > gum::ArcGraphPart::directedPath ( NodeId  node1, NodeId  node2  ) const

inherited

returns a directed path from node1 to node2 belonging to the set of arcs

Parameters

node1	the id from which the path begins
node2	the id to which the path ends

Exceptions

NotFound

exception is raised if no path can be found between the two nodes

Definition at line 190 of file arcGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                           {
    // not recursive version => use a FIFO for simulating the recursion
    List< NodeId > nodeFIFO;
    nodeFIFO.pushBack(n2);

    // mark[node] = successor if visited, else mark[node] does not exist
    NodeProperty< NodeId > mark;
    mark.insert(n2, n2);

    NodeId current;

    while (!nodeFIFO.empty()) {
      current = nodeFIFO.front();
      nodeFIFO.popFront();

      // check the parents

      for (const auto new_one: parents(current)) {
        if (mark.exists(new_one))   // if this node is already marked, do not
          continue;                 // check it again

        mark.insert(new_one, current);

        if (new_one == n1) {
          std::vector< NodeId > v;

          for (current = n1; current != n2; current = mark[current])
            v.push_back(current);

          v.push_back(n2);

          return v;
        }

        nodeFIFO.pushBack(new_one);
      }
    }

    GUM_ERROR(NotFound, "no path found");
  }

Here is the call graph for this function:

directedUnorientedPath()

std::vector< NodeId > gum::ArcGraphPart::directedUnorientedPath ( NodeId  node1, NodeId  node2  ) const

inherited

returns an unoriented (directed) path from node1 to node2 in the arc set

Parameters

node1	the id from which the path begins
node2	the id to which the path ends

Exceptions

NotFound

exception is raised if no path can be found between the two nodes

Definition at line 231 of file arcGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                              {
    // not recursive version => use a FIFO for simulating the recursion
    List< NodeId > nodeFIFO;
    nodeFIFO.pushBack(n2);

    // mark[node] = successor if visited, else mark[node] does not exist
    NodeProperty< NodeId > mark;
    mark.insert(n2, n2);

    NodeId current;

    while (!nodeFIFO.empty()) {
      current = nodeFIFO.front();
      nodeFIFO.popFront();

      // check the parents
      for (const auto new_one: parents(current)) {
        if (mark.exists(new_one))   // the node has already been visited
          continue;

        mark.insert(new_one, current);

        if (new_one == n1) {
          std::vector< NodeId > v;

          for (current = n1; current != n2; current = mark[current])
            v.push_back(current);

          v.push_back(n2);

          return v;
        }

        nodeFIFO.pushBack(new_one);
      }

      // check the children
      for (const auto new_one: children(current)) {
        if (mark.exists(new_one))   // the node has already been visited
          continue;

        mark.insert(new_one, current);

        if (new_one == n1) {
          std::vector< NodeId > v;

          for (current = n1; current != n2; current = mark[current])
            v.push_back(current);

          v.push_back(n2);

          return v;
        }

        nodeFIFO.pushBack(new_one);
      }
    }

    GUM_ERROR(NotFound, "no path found");
  }

Here is the call graph for this function:

empty()

INLINE bool gum::NodeGraphPart::empty ( ) const

inherited

alias for emptyNodes

Definition at line 305 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return emptyNodes(); }

Here is the call graph for this function:

emptyArcs()

INLINE bool gum::ArcGraphPart::emptyArcs ( ) const

inherited

indicates wether the ArcGraphPart contains any arc

Definition at line 34 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return arcs__.empty(); }

Here is the call graph for this function:

emptyNodes()

INLINE bool gum::NodeGraphPart::emptyNodes ( ) const

inherited

indicates whether there exists nodes in the NodeGraphPart

Definition at line 303 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return (sizeNodes() == 0); }

Here is the call graph for this function:

end()

INLINE const NodeGraphPartIterator & gum::NodeGraphPart::end ( ) const

noexceptinherited

the end iterator to parse the set of nodes contained in the NodeGraphPart

Definition at line 338 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                        {
    return endIteratorSafe__;
  }

Here is the call graph for this function:

endSafe()

INLINE const NodeGraphPartIteratorSafe & gum::NodeGraphPart::endSafe ( ) const

noexceptinherited

the end iterator to parse the set of nodes contained in the NodeGraphPart

Definition at line 328 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                                {
    return endIteratorSafe__;
  }

Here is the call graph for this function:

eraseArc()

INLINE void gum::ArcGraphPart::eraseArc ( const Arc &  arc )

virtualinherited

removes an arc from the ArcGraphPart

Parameters

arc	the arc to be removed

Warning

if the arc does not exist, nothing is done. In particular, no exception is thrown. However, the signal onArcDeleted is fired only if a node is effectively removed.

Definition at line 108 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                   {
    // ASSUMING tail and head exists in parents__ anf children__
    // (if not, it is an error)
    if (existsArc(arc)) {
      NodeId tail = arc.tail(), head = arc.head();
      parents__[head]->erase(tail);
      children__[tail]->erase(head);
      arcs__.erase(arc);
      GUM_EMIT2(onArcDeleted, tail, head);
    }
  }

Here is the call graph for this function:

eraseChildren()

INLINE void gum::ArcGraphPart::eraseChildren ( NodeId  id )

inherited

removes all the children of a given node

Parameters

id	the node all the children of which will be removed

Warning

although this method is not virtual, it calls method eraseArc( const Arc& arc ) and, as such, has a "virtual" behaviour. If you do not wish it to have this "virtual" behaviour, call instead method unvirtualizedEraseChildren

if no arc is a parent of id, nothing is done. In particular, no exception is thrown.

Definition at line 139 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                   {
    if (children__.exists(id)) {
      NodeSet& children = *(children__[id]);

      for (auto iter = children.beginSafe();   // safe iterator needed here
           iter != children.endSafe();
           ++iter) {
        // warning: use this erase so that you actually use the vritualized
        // arc removal function
        eraseArc(Arc(id, *iter));
      }
    }
  }

Here is the call graph for this function:

eraseNode()

INLINE void gum::DiGraph::eraseNode ( const NodeId  id )

virtual

remove a node and its adjacent arcs from the graph

Parameters

id	the id of the node to be removed

Warning

if the node does not exist, nothing is done. In particular, no exception is raised.

Reimplemented from gum::NodeGraphPart.

Reimplemented in gum::MixedGraph.

Definition at line 68 of file diGraph_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                {
    // warning: to remove the arcs adjacent to id, use the unvirtualized
    // versions
    // of arc removals
    ArcGraphPart::unvirtualizedEraseParents(id);
    ArcGraphPart::unvirtualizedEraseChildren(id);

    NodeGraphPart::eraseNode(id);
  }

Here is the call graph for this function:

eraseParents()

INLINE void gum::ArcGraphPart::eraseParents ( NodeId  id )

inherited

erase all the parents of a given node

Parameters

id	the node all the parents of which will be removed

Warning

although this method is not virtual, it calls method eraseArc( const Arc& arc ) and, as such, has a "virtual" behaviour. If you do not wish it to have this "virtual" behaviour, call instead method unvirtualizedEraseParents

if no arc is a parent of id, nothing is done. In particular, no exception is thrown.

Definition at line 125 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                  {
    if (parents__.exists(id)) {
      NodeSet& parents = *(parents__[id]);

      for (auto iter = parents.beginSafe();   // safe iterator needed here
           iter != parents.endSafe();
           ++iter) {
        // warning: use this erase so that you actually use the virtualized
        // arc removal function
        eraseArc(Arc(*iter, id));
      }
    }
  }

Here is the call graph for this function:

eraseSetOfArcs_()

INLINE void gum::ArcGraphPart::eraseSetOfArcs_ ( const ArcSet &  set )

protectedinherited

a (virtualized) function to remove a given set of arcs

Warning

this function uses eraseArc, which is a virtual function. Hence the behaviour of this function is that of a virtual function

Definition at line 120 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                             {
    for (const auto& arc: set)
      eraseArc(arc);
  }

Here is the call graph for this function:

exists()

INLINE bool gum::NodeGraphPart::exists ( const NodeId  id ) const

inherited

alias for existsNode

Definition at line 291 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                           {
    return existsNode(node);
  }

Here is the call graph for this function:

existsArc() [1/2]

INLINE bool gum::ArcGraphPart::existsArc ( const Arc &  arc ) const

inherited

indicates whether a given arc exists

Parameters

arc	the arc we test whether or not it belongs to the ArcGraphPart

Definition at line 40 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                          {
    return arcs__.contains(arc);
  }

Here is the call graph for this function:

existsArc() [2/2]

INLINE bool gum::ArcGraphPart::existsArc ( NodeId  tail, NodeId  head  ) const

inherited

indicates whether a given arc exists

Parameters

tail	the tail of the arc we test the existence in the ArcGraphPart
head	the head of the arc we test the existence in the ArcGraphPart

Definition at line 44 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                    {
    return parents__.exists(head) && parents__[head]->exists(tail);
  }

Here is the call graph for this function:

existsNode()

INLINE bool gum::NodeGraphPart::existsNode ( const NodeId  id ) const

inherited

returns true iff the NodeGraphPart contains the given nodeId

Definition at line 285 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                               {
    if (node >= boundVal__) return false;

    return (!inHoles__(node));
  }

Here is the call graph for this function:

family() [1/2]

INLINE NodeSet gum::ArcGraphPart::family ( NodeId  id ) const

inherited

returns the set of nodes which consists in the node and its parents

Note that the set of nodes returned may be empty if no path within the ArcGraphPart is outgoing from the given node.

Parameters

id	the node which is the tail of a directed path with the returned nodes

Definition at line 61 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                     {
    checkParents__(id);
    NodeSet res{id};
    return res + parents(id);
  }

Here is the call graph for this function:

family() [2/2]

INLINE NodeSet gum::ArcGraphPart::family ( const NodeSet &  ids ) const

inherited

returns the set of family nodes of a set of nodes

Definition at line 84 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                              {
    NodeSet res;
    for (const auto node: ids)
      res += family(node);
    return res;
  }

Here is the call graph for this function:

hasDirectedPath()

bool gum::DiGraph::hasDirectedPath	(	const NodeId	from,
		const NodeId	to
	)

checks whether there exists a directed path from from to to

If from==to, this function checks if a directed cycle containing from exists.

Parameters

from
to

Returns

true if a directed path exists

Definition at line 136 of file diGraph.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                  {
    if (!exists(from)) return false;

    // not recursive version => use a FIFO for simulating the recursion
    List< NodeId > nodeFIFO;
    nodeFIFO.pushBack(from);

    NodeSet marked;
    marked.insert(from);

    NodeId new_one;

    while (!nodeFIFO.empty()) {
      new_one = nodeFIFO.front();
      // std::cout<<new_one<<std::endl;
      nodeFIFO.popFront();

      for (const auto chi: children(new_one)) {
        if (chi == to) return true;

        if (!marked.contains(chi)) {
          nodeFIFO.pushBack(chi);
          marked.insert(chi);
        }
      }
    }

    return false;
  }

Here is the call graph for this function:

listMapArcs()

template<typename VAL >

List< VAL > gum::ArcGraphPart::listMapArcs ( VAL(*)(const Arc &)  f ) const

inherited

a method to create a list of VAL from a set of arcs (using for every arc, say x, the VAL f(x))

Parameters

f	a function assigning a VAL to any arc

listMapNodes()

template<typename VAL >

List< VAL > gum::NodeGraphPart::listMapNodes ( VAL(*)(const NodeId &)  f ) const

inherited

a method to create a list of VAL from a set of nodes (using for every nodee, say x, the VAL f(x))

Parameters

f	a function assigning a VAL to any node

nextNodeId()

INLINE NodeId gum::NodeGraphPart::nextNodeId ( ) const

inherited

returns a new node id, not yet used by any node

Warning

a code like

id=nextNodeId();addNode(id); 

is basically not thread safe !!

Returns

a node id not yet used by any node within the NodeGraphPart

Definition at line 225 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                {
    NodeId next = 0;

    // return the first hole if holes exist
    if (holes__ && (!holes__->empty()))
      next = *(holes__->begin());
    else   // in other case
      next = boundVal__;

    return next;
  }

Here is the call graph for this function:

nodes()

INLINE const NodeGraphPart & gum::NodeGraphPart::nodes ( ) const

inherited

return *this as a NodeGraphPart

Definition at line 372 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                         {
    return *(static_cast< const NodeGraphPart* >(this));
  }

Here is the call graph for this function:

nodesProperty() [1/2]

template<typename VAL >

NodeProperty< VAL > gum::NodeGraphPart::nodesProperty ( VAL(*)(const NodeId &)  f, Size  size = 0  ) const

inherited

a method to create a HashTable with key:NodeId and value:VAL

VAL are computed from the nodes using for all node x, VAL f(x). This method is a wrapper of the same method in HashTable.

See also

HashTable::map.

Parameters

f	a function assigning a VAL to any node
size	an optional parameter enabling to fine-tune the returned Property. Roughly speaking, it is a good practice to have a size equal to half the number of nodes. If you do not specify this parameter, the method will assign it for you.

nodesProperty() [2/2]

template<typename VAL >

NodeProperty< VAL > gum::NodeGraphPart::nodesProperty ( const VAL &  a, Size  size = 0  ) const

inherited

a method to create a hashMap with key:NodeId and value:VAL

for all nodes, the value stored is a. This method is a wrapper of the same method in HashTable.

See also

HashTable::map.

Parameters

a	the default value assigned to each edge in the returned Property
size	an optional parameter enabling to fine-tune the returned Property. Roughly speaking, it is a good practice to have a size equal to half the number of nodes. If you do not specify this parameter, the method will assign it for you.

operator!=() [1/3]

INLINE bool gum::ArcGraphPart::operator!= ( const ArcGraphPart &  p ) const

inherited

tests whether two ArcGraphParts contain different arcs

Parameters

p	the ArcGraphPart that we compare with this

Definition at line 186 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                  {
    return arcs__ != p.arcs__;
  }

Here is the call graph for this function:

operator!=() [2/3]

INLINE bool gum::DiGraph::operator!=

(

const DiGraph &

g

)

const

tests whether two DiGraphs are different

Parameters

g	the DiGraph with which "this" is compared

Definition at line 82 of file diGraph_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                        {
    return !operator==(p);
  }

Here is the call graph for this function:

operator!=() [3/3]

INLINE bool gum::NodeGraphPart::operator!= ( const NodeGraphPart &  p ) const

inherited

check whether two NodeGraphParts contain different nodes

Parameters

p	the NodeGraphPart to be compared with "this"

Definition at line 356 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                    {
    return !operator==(p);
  }

Here is the call graph for this function:

operator=()

INLINE DiGraph & gum::DiGraph::operator=

(

const DiGraph &

g

)

copy operator

Parameters

g	the DiGraph to copy

Definition at line 47 of file diGraph_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                     {
    // avoid self assigment
    if (this != &g) {
      DiGraph::clear();
      NodeGraphPart::operator=(g);
      ArcGraphPart:: operator=(g);

      if (mutableTopologicalOrder__ != nullptr) {
        delete mutableTopologicalOrder__;
        mutableTopologicalOrder__ = nullptr;
      }

      if (g.mutableTopologicalOrder__ != nullptr) {
        mutableTopologicalOrder__
           = new Sequence< NodeId >(*(g.mutableTopologicalOrder__));
      }
    }

    return *this;
  }

Here is the call graph for this function:

operator==() [1/3]

INLINE bool gum::ArcGraphPart::operator== ( const ArcGraphPart &  p ) const

inherited

tests whether two ArcGraphParts contain the same arcs

Parameters

p	the ArcGraphPart that we compare with this

Definition at line 182 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                  {
    return arcs__ == p.arcs__;
  }

Here is the call graph for this function:

operator==() [2/3]

INLINE bool gum::DiGraph::operator==

(

const DiGraph &

g

)

const

tests whether two DiGraphs are identical (same nodes, same arcs)

Parameters

g	the DiGraph with which "this" is compared

Definition at line 78 of file diGraph_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                        {
    return ArcGraphPart::operator==(p) && NodeGraphPart::operator==(p);
  }

Here is the call graph for this function:

operator==() [3/3]

INLINE bool gum::NodeGraphPart::operator== ( const NodeGraphPart &  p ) const

inherited

check whether two NodeGraphParts contain the same nodes

Parameters

p	the NodeGraphPart to be compared with "this"

Definition at line 342 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                    {
    if (boundVal__ != p.boundVal__) return false;

    if (holes__)
      if (p.holes__)
        return (*holes__ == *p.holes__);
      else
        return false;
    else if (p.holes__)
      return false;

    return true;
  }

Here is the call graph for this function:

parents() [1/2]

INLINE const NodeSet & gum::ArcGraphPart::parents ( NodeId  id ) const

inherited

returns the set of nodes with arc ingoing to a given node

Note that the set of arcs returned may be empty if no arc within the ArcGraphPart is ingoing into the given node.

Parameters

id	the node toward which the arcs returned are pointing

Definition at line 56 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                             {
    checkParents__(id);
    return *(parents__[id]);
  }

Here is the call graph for this function:

parents() [2/2]

INLINE NodeSet gum::ArcGraphPart::parents ( const NodeSet &  ids ) const

inherited

returns the set of parents of a set of nodes

Definition at line 76 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                               {
    NodeSet res;
    for (const auto node: ids)
      res += parents(node);
    return res;
  }

Here is the call graph for this function:

populateNodes()

void gum::NodeGraphPart::populateNodes ( const NodeGraphPart &  s )

inherited

populateNodes clears *this and fills it with the same nodes as "s"

populateNodes should basically be the preferred way to insert nodes with IDs not selected by the internal idFactory.

Parameters

s	the NodeGraphPart to be copied

Definition at line 63 of file nodeGraphPart.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                          {
    clear();   // "virtual" flush of the nodes set
    holes_size__          = s.holes_size__;
    holes_resize_policy__ = s.holes_resize_policy__;

    if (s.holes__) holes__ = new NodeSet(*s.holes__);

    boundVal__ = s.boundVal__;

    updateEndIteratorSafe__();
  }

Here is the call graph for this function:

populateNodesFromProperty()

template<typename T >

void gum::NodeGraphPart::populateNodesFromProperty ( const NodeProperty< T > &  h )

inherited

populateNodesFromProperty clears *this and fills it with the keys of "h"

populateNodes should basically be the preferred way to insert nodes with IDs not selected by the internal idFactory.

size()

INLINE Size gum::NodeGraphPart::size ( ) const

inherited

alias for sizeNodes

Definition at line 283 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return sizeNodes(); }

Here is the call graph for this function:

sizeArcs()

INLINE Size gum::ArcGraphPart::sizeArcs ( ) const

inherited

indicates the number of arcs stored within the ArcGraphPart

Definition at line 36 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

{ return arcs__.size(); }

Here is the call graph for this function:

sizeNodes()

INLINE Size gum::NodeGraphPart::sizeNodes ( ) const

inherited

returns the number of nodes in the NodeGraphPart

Definition at line 279 of file nodeGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                             {
    return (holes__) ? (boundVal__ - holes__->size()) : boundVal__;
  }

Here is the call graph for this function:

toDot()

std::string gum::DiGraph::toDot ( ) const

virtual

to friendly display the content of the graph in the DOT syntax

Parameters

name	The graph name in the dot syntax. Default is G.

Returns

Returns a string describing the graph in the dot syntax

Reimplemented in gum::MixedGraph.

Definition at line 67 of file diGraph.cpp.

References gum::Set< Key, Alloc >::emplace().

                                 {
    std::stringstream strBuff;
    std::string       tab = "     ";
    strBuff << "digraph {" << std::endl;

    for (const auto node: nodes())
      strBuff << tab << node << ";" << std::endl;

    strBuff << std::endl;

    for (const auto& arc: arcs())
      strBuff << tab << arc.tail() << " -> " << arc.head() << ";" << std::endl;

    strBuff << "}" << std::endl << std::endl;
    return strBuff.str();
  }

Here is the call graph for this function:

topologicalOrder()

const Sequence< NodeId > & gum::DiGraph::topologicalOrder

(

bool

clear = true

)

const

The topological order stays the same as long as no variable or arcs are added or erased src the topology.

Parameters

clear

If false returns the previously created topology.

Exceptions

InvalidDirectedCycle

Raised if this DiGraph contains cycles.

Definition at line 90 of file diGraph.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                      {
    if (clear
        || (mutableTopologicalOrder__
            == nullptr)) {   // we have to call topologicalOrder_
      if (mutableTopologicalOrder__ == nullptr) {
        mutableTopologicalOrder__ = new Sequence< NodeId >();
      } else {
        // clear is True
        mutableTopologicalOrder__->clear();
      }

      topologicalOrder__();
    }

    return *mutableTopologicalOrder__;
  }

Here is the call graph for this function:

topologicalOrder__()

void gum::DiGraph::topologicalOrder__ ( ) const

private

Returns a topological order of this DAGModel.

Warning

mutableTopologicalOrder__ is assumed to be valid and empty

Definition at line 107 of file diGraph.cpp.

References gum::Set< Key, Alloc >::emplace().

                                         {
    auto dag   = *this;
    auto roots = std::vector< NodeId >();

    for (const auto node: dag.nodes()) {
      if (dag.parents(node).empty()) { roots.push_back(node); }
    }

    while (roots.size()) {
      if (mutableTopologicalOrder__->exists(roots.back())) {
        GUM_ERROR(InvalidDirectedCycle,
                  "cycles prevent the creation of a topological ordering.");
      }
      mutableTopologicalOrder__->insert(roots.back());
      roots.pop_back();

      while (dag.children(mutableTopologicalOrder__->back()).size()) {
        auto back  = mutableTopologicalOrder__->back();
        auto child = *(dag.children(back).begin());
        dag.eraseArc(Arc(back, child));

        if (dag.parents(child).empty()) { roots.push_back(child); }
      }
    }

    GUM_ASSERT(dag.sizeArcs() == (gum::Size)(0));
    GUM_ASSERT(mutableTopologicalOrder__->size() == dag.size());
  }

Here is the call graph for this function:

toString()

std::string gum::DiGraph::toString ( ) const

virtual

to friendly display the content of the graph

Reimplemented from gum::NodeGraphPart.

Reimplemented in gum::MixedGraph.

Definition at line 60 of file diGraph.cpp.

References gum::Set< Key, Alloc >::emplace().

                                    {
    std::string s = NodeGraphPart::toString();
    s += " , ";
    s += ArcGraphPart::toString();
    return s;
  }

Here is the call graph for this function:

unvirtualizedEraseChildren()

INLINE void gum::ArcGraphPart::unvirtualizedEraseChildren ( NodeId  id )

inherited

same function as eraseChildren but without any virtual call to an erase

Parameters

id	the node whose outgoing arcs will be removed

Definition at line 170 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                {
    if (children__.exists(id)) {
      NodeSet& children = *(children__[id]);

      for (auto iter = children.beginSafe();   // safe iterator needed here
           iter != children.endSafe();
           ++iter) {
        ArcGraphPart::eraseArc(Arc(id, *iter));
      }
    }
  }

Here is the call graph for this function:

unvirtualizedEraseParents()

INLINE void gum::ArcGraphPart::unvirtualizedEraseParents ( NodeId  id )

inherited

same function as eraseParents but without any virtual call to an erase

Parameters

id	the node whose ingoing arcs will be removed

Definition at line 158 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                               {
    if (parents__.exists(id)) {
      NodeSet& parents = *(parents__[id]);

      for (auto iter = parents.beginSafe();   // safe iterator needed here
           iter != parents.endSafe();
           ++iter) {
        ArcGraphPart::eraseArc(Arc(*iter, id));
      }
    }
  }

Here is the call graph for this function:

unvirtualizedEraseSetOfArcs_()

INLINE void gum::ArcGraphPart::unvirtualizedEraseSetOfArcs_ ( const ArcSet &  set )

protectedinherited

similar to eraseSetOfArcs_ except that it is unvirtualized

Warning

this function uses ArcGraphPart::eraseArc, hence, as compared with eraseSetOfArcs_, it removes the arcs without calling a virtual eraseArc

Definition at line 153 of file arcGraphPart_inl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                          {
    for (const auto& arc: set)
      ArcGraphPart::eraseArc(arc);
  }

Here is the call graph for this function:

Member Data Documentation

mutableTopologicalOrder__

Sequence< NodeId >* gum::DiGraph::mutableTopologicalOrder__

mutableprivate

The topology sequence of this Directed Graphical Model.

Definition at line 209 of file diGraph.h.

onArcAdded

Signaler2< NodeId, NodeId > gum::ArcGraphPart::onArcAdded

inherited

Definition at line 82 of file arcGraphPart.h.

onArcDeleted

Signaler2< NodeId, NodeId > gum::ArcGraphPart::onArcDeleted

inherited

Definition at line 83 of file arcGraphPart.h.

onNodeAdded

Signaler1< NodeId > gum::NodeGraphPart::onNodeAdded

inherited

Definition at line 271 of file nodeGraphPart.h.

onNodeDeleted

Signaler1< NodeId > gum::NodeGraphPart::onNodeDeleted

inherited

Definition at line 272 of file nodeGraphPart.h.

---

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

• agrum/tools/graphs/diGraph.h
• agrum/tools/graphs/diGraph.cpp
• agrum/tools/graphs/diGraph_inl.h