40namespace steiner_tree {
Includes declaration of graph class.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Interface for core edge finder algorithms.
virtual void call(const Graph &graph, const List< node > &terminals, EdgeArray< bool > &isInTree) const =0
Compute a set of core edges.
The namespace for all OGDF objects.