ogdf::steiner_tree::Full2ComponentGenerator< T > Class Template Reference

Trivial full 2-component generation by lookups of shortest paths between terminal pairs. More...

#include <ogdf/graphalg/steiner_tree/Full2ComponentGenerator.h>

Public Member Functions
void	call (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< NodeArray< T > > &distance, const NodeArray< NodeArray< edge > > &pred, std::function< void(node, node, T)> generateFunction) const
	Generate full 2-components and call generateFunction for each full 2-component.

Detailed Description

template<typename T>
class ogdf::steiner_tree::Full2ComponentGenerator< T >

Trivial full 2-component generation by lookups of shortest paths between terminal pairs.

A full 2-component is a path that starts and ends with a terminal but has no terminal in between.

Definition at line 46 of file Full2ComponentGenerator.h.

Member Function Documentation

call()

template<typename T >

void ogdf::steiner_tree::Full2ComponentGenerator< T >::call ( const EdgeWeightedGraph< T > &  G, const List< node > &  terminals, const NodeArray< NodeArray< T > > &  distance, const NodeArray< NodeArray< edge > > &  pred, std::function< void(node, node, T)>  generateFunction  ) const

inline

Generate full 2-components and call generateFunction for each full 2-component.

Definition at line 49 of file Full2ComponentGenerator.h.

---

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

• include/ogdf/graphalg/steiner_tree/Full2ComponentGenerator.h