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
34#include <ogdf/basic/Graph.h>
35
36namespace ogdf {
37template<class E>
38class List;
39
40namespace steiner_tree {
41namespace goemans {
42
44template<typename T>
46public:
51 virtual void call(const Graph& graph, const List<node>& terminals,
52 EdgeArray<bool>& isInTree) const = 0;
53};
54
55}
56}
57}
Includes declaration of graph class.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition Graph_d.h:717
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.