Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::steiner_tree::goemans::CoreEdgeRandomSpanningTree< T > Class Template Reference

Computes a random set of core edges. More...

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

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

Public Member Functions

 CoreEdgeRandomSpanningTree (std::minstd_rand &rng)
 
void call (const Graph &graph, const List< node > &terminals, EdgeArray< bool > &isInTree) const override
 Compute a set of core edges. More...
 

Private Attributes

std::minstd_rand & m_rng
 

Detailed Description

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

Computes a random set of core edges.

Definition at line 44 of file CoreEdgeRandomSpanningTree.h.

Constructor & Destructor Documentation

◆ CoreEdgeRandomSpanningTree()

template<typename T >
ogdf::steiner_tree::goemans::CoreEdgeRandomSpanningTree< T >::CoreEdgeRandomSpanningTree ( std::minstd_rand &  rng)
inline

Definition at line 50 of file CoreEdgeRandomSpanningTree.h.

Member Function Documentation

◆ call()

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

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

Implements ogdf::steiner_tree::goemans::CoreEdgeModule< T >.

Definition at line 55 of file CoreEdgeRandomSpanningTree.h.

Member Data Documentation

◆ m_rng

template<typename T >
std::minstd_rand& ogdf::steiner_tree::goemans::CoreEdgeRandomSpanningTree< T >::m_rng
private

Definition at line 47 of file CoreEdgeRandomSpanningTree.h.


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