Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::steiner_tree::goemans::CoreEdgeModule< T > Class Template Referenceabstract

Interface for core edge finder algorithms. More...

#include <ogdf/graphalg/steiner_tree/goemans/CoreEdgeModule.h>

+ Inheritance diagram for ogdf::steiner_tree::goemans::CoreEdgeModule< T >:

Public Member Functions

virtual void call (const Graph &graph, const List< node > &terminals, EdgeArray< bool > &isInTree) const =0
 Compute a set of core edges. More...
 

Detailed Description

template<typename T>
class ogdf::steiner_tree::goemans::CoreEdgeModule< T >

Interface for core edge finder algorithms.

Definition at line 42 of file CoreEdgeModule.h.

Member Function Documentation

◆ call()

template<typename T >
virtual void ogdf::steiner_tree::goemans::CoreEdgeModule< T >::call ( const Graph graph,
const List< node > &  terminals,
EdgeArray< bool > &  isInTree 
) const
pure virtual

Compute a set of core edges.

Parameters
graphThe input graph
terminalsThe terminals of the given graph
isInTreeThe resulting EdgeArray where an edge is true iff it is not a core edge

Implemented in ogdf::steiner_tree::goemans::CoreEdgeRandomSpanningTree< T >.


The documentation for this class was generated from the following file: