25 #ifndef GUM_MIXEDGRAPH_LISTENER_H 26 #define GUM_MIXEDGRAPH_LISTENER_H 125 #ifndef GUM_NO_INLINE 127 #endif // GUM_NOINLINE 129 #endif // GUM_MIXEDGRAPH_LISTENER_H virtual void whenEdgeAdded(const void *src, NodeId id1, NodeId id2)=0
the action to take when a new edge is inserted into the graph
MixedGraph * _graph
the graph to listen to
MixedGraphListener & operator=(const MixedGraphListener &d)
copy operator (for the moment, this operation is forbidden)
virtual void whenArcAdded(const void *src, NodeId from, NodeId to)=0
the action to take when a new arc is inserted into the graph
gum is the global namespace for all aGrUM entities
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
~MixedGraphListener()
destructor
Inline implementation fo base classes for mixed graphs listener.
Abstract Base class for all mixed Graph Listener.
virtual void whenNodeAdded(const void *src, NodeId id)=0
the action to take when a new node is inserted into the graph
MixedGraphListener(MixedGraph *g)
default constructor
virtual void whenNodeDeleted(const void *src, NodeId id)=0
the action to take when a node has just been removed from the graph
virtual void whenArcDeleted(const void *src, NodeId from, NodeId to)=0
the action to take when an arc has just been removed from the graph
Base classes for mixed directed/undirected graphs.
Size NodeId
Type for node ids.
Every class who would catch signal from signaler should derive from Listener.
Base class for mixed graphs.