A heuristic algorithm to solve the D-Family-matching problem by using spanning trees. More...

#include <Spanning_tree_solver.hpp>

Constructors
	T_Spanning_tree_solver ()
	The best score is always initialized at 0.

Functor
unsigned	operator() (unsigned D, Solution_type &solutions)
	A functor to solve the D-Family-matching problem using the heuristic algorithm on the given intersection graph m_graph. Updates the graph if required.

Iterators
Meta_clusters_iterator	meta_clusters_begin ()
	Iterate over meta clusters.
Clusters_iterator	clusters_in_meta_cluster_begin (unsigned meta_index)
	Iterate over clusters contained in a meta cluster.

Command line options
boost::program_options::options_description	add_options (void)
	Just to add options on the command line.

Detailed Description

template<class IntersectionGraph, class StopCondition, class SpanningTreeGenerator, class Algorithm>
class SBL::CADS::T_Spanning_tree_solver< IntersectionGraph, StopCondition, SpanningTreeGenerator, Algorithm >

A heuristic algorithm to solve the D-Family-matching problem by using spanning trees.

The graph must be weighted.

Template Parameters

Graph	Representation of the intersection graph.
StopCondition	A functor to compute if the stop condition is met. Also provides the definitions of the Solution space (which is inherent to a particular stop condition).
SpanningTreeGenerator	A method to generate a spanning tree over a connected component of the intersection graph
Algorithm	The algorithm to solve the D-Family-matching problem over a tree.