T_Tree_solver< Graph > Class Template Reference

A dynamic programming algorithm which solves the D family matching problem for trees. More...

#include <Algorithms.hpp>

Constructors
	T_Tree_solver (Graph *g)
	Initialize the pointer to the graph.

Functor
Sub_graph	operator() (Tree &t, unsigned D)

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

Detailed Description

template<class Graph>
class SBL::CADS::T_Tree_solver< Graph >

A dynamic programming algorithm which solves the D family matching problem for trees.

The graph must be weighted.

Template Parameters

Graph

Representation of a graph.

Constructor & Destructor Documentation

T_Tree_solver()

template<class Graph>

T_Tree_solver ( Graph * g )

inline

Initialize the pointer to the graph.

Member Function Documentation

add_options()

template<class Graph>

boost::program_options::options_description add_options ( void )

inline

Just to add options on the command line.

operator()()

template<class Graph>

T_Tree_solver< Graph >::Sub_graph operator() ( Tree & t, unsigned D )

inline

A functor that computes a solution to the D family matching problem for a given Tree t (that is a spanning tree on m_graph) and a parameter D. Returns a Sub_graph (which is the optimal constructed solution over the Tree)