Module problem_generator::problem::clique_tree [−][src]
Expand description
Module for the 1) Clique Tree construction and global optimum calculation, 2) and the struct to contain solutions.
Structs
The CliqueTree struct with properties input parameters, clique variable indices, the used codomain function, codomain values, global optimum strings and score
Struct to contain the input parameters of the TD Mk Landscape: Number of cliques/subfunctions M, size k of each clique/subfunction, number of overlapping variables between cliques/subfunctions o, number of branches in the clique tree / tree decomposition b
Struct to contain the solution and its fitness, with the solution stored as a vector of u32 values (0 or 1) and the fitness as a f64 value
Functions
Get all possible (sub)strings for a given length (bits)
Get an iterator for all possible substrings of certain length
Transform the passed substring into an index(bit value) that would point to that substring