|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
The namespace for all OGDF objects.
Includes declaration of graph class.
Greedy algorithm for computing a maximal acyclic subgraph.
Array< ListPure< node > > m_B
Declaration of interface for acyclic subgraph algorithms.
The parameterized class Array implements dynamic arrays of type E.
NodeArray< bool > m_visited
NodeArray< ListIterator< node > > m_item
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Base class of algorithms for computing a maximal acyclic subgraph.
Declaration and implementation of Array class and Array algorithms.
Declaration of doubly linked lists and iterators.
Class for the representation of nodes.