Documentation ¶
Overview ¶
A brute force solver for the "Weighted Exact Cover Problem".
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func MakeInstance ¶
Make an Instance and check the constraints that an Instance should satisfy.
func SolveByBruteForce ¶
func SolveByBruteForce(ins instance) (subsetsEval, error)
SolveByBruteForce attempts finds a minimum cost exact cover for an instance.
If a minimum cost exact cover exists, the returned subsetsEval will contain indices to this cover and its exactlyCovered flag will be true. Otherwise, the zero value of subsetEval will be returned.
Types ¶
This section is empty.
Click to show internal directories.
Click to hide internal directories.