D_family_matching

Classes
class	T_Tree_solver< Graph >
	A dynamic programming algorithm which solves the D family matching problem for trees. More...
class	T_Tree< Graph >
	A superstructure over the Graph used to represent trees. More...
class	T_Sub_graph< Graph >
	A superstructure over the Graph used to represent non-induced sub-graphs. More...
class	D_Solution
	The solution space for the Maximum Spanning tree algorithm. More...
class	Maximum_spanning_tree_property
	The solution space for the maximum spanning tree algorithm. More...
class	T_Random_spanning_tree_property< Dummy >
	The solution space for the random spanning tree algorithm. More...
class	T_Maximum_spanning_tree_generator< Graph >
	Generates a Maximum spanning tree over a given graph (using boost::graph). More...
class	T_Random_spanning_tree_generator< Graph >
	Generates a Random spanning tree over a given graph (using boost::graph). More...
class	T_Spanning_tree_solver< IntersectionGraph, StopCondition, SpanningTreeGenerator, Algorithm >
	A heuristic algorithm to solve the D-Family-matching problem by using spanning trees. More...

Description