Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
CoreEdgeModule.h
Go to the documentation of this file.
1
32#pragma once
33
35
36namespace ogdf {
37namespace steiner_tree {
38namespace goemans {
39
41template<typename T>
43public:
48 virtual void call(const Graph& graph, const List<node>& terminals,
49 EdgeArray<bool>& isInTree) const = 0;
50};
51
52}
53}
54}
Declaration and implementation of EdgeArray class.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
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.