paal::ir::steiner_tree_graph_all_generator< Graph, Vertex, Terminals > Class Template Reference

#include <steiner_strategy.hpp>

Public Member Functions
	steiner_tree_graph_all_generator (const Graph &graph, const Terminals &terminals, int K=4)
	Constructor.
template<typename Metric >
void	gen_components (const Metric &cost_map, const Terminals &terminals, const Terminals &steiner_vertices, steiner_components< typename MTraits< Metric >::VertexType, typename MTraits< Metric >::DistanceType > &components)
	Generates all possible components.

Detailed Description

template<typename Graph, typename Vertex, typename Terminals>
class paal::ir::steiner_tree_graph_all_generator< Graph, Vertex, Terminals >

Generates all the components possible based on the underlying graph. It iterates over all subsets of terminals with no more than K elements.

Definition at line 105 of file steiner_strategy.hpp.

---

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

• include/paal/iterative_rounding/steiner_tree/steiner_strategy.hpp