73 m_pGraph->unregisterStructure(m_itGList);
81 m_pGraph->unregisterStructure(m_itGList);
83 if ((m_pGraph =
pG) !=
nullptr) {
84 m_itGList =
pG->registerStructure(
this);
Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Class for the representation of edges.
Data type for general directed graphs (adjacency list representation).
Abstract Base class for graph observers.
virtual ~GraphObserver()
Destroys the instance, unregisters it from watched graph.
const Graph * getGraph() const
virtual void edgeDeleted(edge e)=0
Called by watched graph when an edge is deleted Has to be implemented by derived classes.
void reregister(const Graph *pG)
Associates observer instance with graph G.
ListIterator< GraphObserver * > m_itGList
watched graph
virtual void nodeDeleted(node v)=0
Called by watched graph when a node is deleted Has to be implemented by derived classes.
virtual void edgeAdded(edge e)=0
Called by watched graph when an edge is added Has to be implemented by derived classes.
virtual void nodeAdded(node v)=0
Called by watched graph when a node is added Has to be implemented by derived classes.
virtual void cleared()=0
Called by watched graph when its clear function is called Has to be implemented by derived classes.
GraphObserver(const Graph *G)
Constructs instance of GraphObserver class.
GraphObserver()
Constructs instance of GraphObserver class.
Encapsulates a pointer to a list element.
Class for the representation of nodes.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.