aGrUM  0.16.0
undiGraphListener.h
Go to the documentation of this file.
1 
28 #ifndef GUM_UNDIGRAPH_LISTENER_H
29 #define GUM_UNDIGRAPH_LISTENER_H
30 
32 #include <agrum/graphs/undiGraph.h>
33 
34 namespace gum {
49  class UndiGraphListener : public Listener {
50  public:
51  // ############################################################################
53  // ############################################################################
55 
57 
62 
65 
67 
68  // ############################################################################
70  // ############################################################################
72 
74 
76  virtual void whenNodeAdded(const void* src, NodeId id) = 0;
77 
79 
81  virtual void whenNodeDeleted(const void* src, NodeId id) = 0;
82 
84 
88  virtual void whenEdgeAdded(const void* src, NodeId id1, NodeId id2) = 0;
89 
91 
94  virtual void whenEdgeDeleted(const void* src, NodeId from, NodeId to) = 0;
95 
97 
98  protected:
101 
102  private:
104 
106 
108 
110  };
111 
112 } // namespace gum
113 
114 #ifndef GUM_NO_INLINE
116 #endif // GUM_NOINLINE
117 
118 #endif // GUM_UNDIGRAPH_LISTENER_H
UndiGraph * _graph
the graph to listen to
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
UndiGraphListener(UndiGraph *g)
default constructor
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
UndiGraphListener & operator=(const UndiGraphListener &d)
copy operator (for the moment, this operation is forbidden)
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
virtual void whenEdgeAdded(const void *src, NodeId id1, NodeId id2)=0
the action to take when a new edge is inserted into the graph
Abstract Base class for all undiGraph Listener.
virtual void whenNodeDeleted(const void *src, NodeId id)=0
the action to take when a node has just been removed from the graph
Base class for undirected graphs.
Definition: undiGraph.h:109
virtual void whenEdgeDeleted(const void *src, NodeId from, NodeId to)=0
the action to take when an edge has just been removed from the graph
virtual void whenNodeAdded(const void *src, NodeId id)=0
the action to take when a new node is inserted into the graph
Size NodeId
Type for node ids.
Definition: graphElements.h:98
Every class who would catch signal from signaler should derive from Listener.
Definition: listener.h:74