37namespace steiner_tree {
Declaration and implementation of EdgeArray class.
Dynamic arrays indexed with edges.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
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.