Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Basic declarations, included by all source files.
Class for the representation of edges.
Data type for general directed graphs (adjacency list representation).
Creates a reduced graph by removing leaves, self-loops, and reducing chains.
const Graph & original() const
NodeArray< node > m_vOrig
const List< edge > & original(edge e) const
NodeArray< node > m_vReduction
GraphReduction(const Graph &G)
node reduction(node v) const
node original(node v) const
EdgeArray< edge > m_eReduction
virtual ~GraphReduction()
EdgeArray< List< edge > > m_eOrig
edge reduction(edge e) const
Doubly linked lists (maintaining the length of the list).
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.