Open
Graph Drawing
Framework

  v. 2023.09 (Elderberry)
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files

CoreEdgeModule.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/EdgeArray.h>
35 
36 namespace ogdf {
37 namespace steiner_tree {
38 namespace goemans {
39 
41 template<typename T>
42 class CoreEdgeModule {
43 public:
48  virtual void call(const Graph& graph, const List<node>& terminals,
49  EdgeArray<bool>& isInTree) const = 0;
50 };
51 
52 }
53 }
54 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
EdgeArray.h
Declaration and implementation of EdgeArray class.
ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition: List.h:42
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::steiner_tree::goemans::CoreEdgeModule
Interface for core edge finder algorithms.
Definition: CoreEdgeModule.h:42
ogdf::steiner_tree::goemans::CoreEdgeModule::call
virtual void call(const Graph &graph, const List< node > &terminals, EdgeArray< bool > &isInTree) const =0
Compute a set of core edges.
ogdf::internal::EdgeArrayBase2
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition: Graph_d.h:709