The solution space for the Maximum Spanning tree algorithm.
More...
#include <Solution_space_property_computers.hpp>
|
| unsigned | K |
| | The number of meta-clusters.
|
| unsigned | D |
| | The diameter of the solution (by parameter)
|
| int | score |
| | The score of the solution.
|
| std::vector< unsigned > | meta_cluster_sizes |
| | The sizes of each individual meta cluster.
|
|
| void | update_solution (unsigned K, unsigned D, int score, std::vector< unsigned > sizes) |
| | This function is needed for the cases where the solution space is a unique D solution.
|
The solution space for the Maximum Spanning tree algorithm.
◆ D_Solution() [1/2]
The individual D_Solution is always initialized with a score = -1.
◆ D_Solution() [2/2]
| D_Solution |
( |
unsigned | K, |
|
|
unsigned | D, |
|
|
int | score, |
|
|
std::vector< unsigned > | meta_cluster_sizes ) |
|
inline |
Initialization from given parameters.
◆ update_solution()
| void update_solution |
( |
unsigned | K, |
|
|
unsigned | D, |
|
|
int | score, |
|
|
std::vector< unsigned > | sizes ) |
|
inline |
This function is needed for the cases where the solution space is a unique D solution.
The diameter of the solution (by parameter)
The number of meta-clusters.
◆ meta_cluster_sizes
| std::vector<unsigned> meta_cluster_sizes |
The sizes of each individual meta cluster.
◆ score
The score of the solution.