An implementation of Donald Knuth's Dancing Links Algorithm to solve exact cover problems.
var dlx = require('dancing');
var matrix = [
[1, 0, 0, 1, 0, 0, 1],
[1, 0, 0, 1, 0, 0, 0],
[0, 0, 0, 1, 1, 0, 1],
[0, 0, 1, 0, 1, 1, 0],
[0, 1, 1, 0, 0, 1, 1],
[0, 1, 0, 0, 0, 0, 1]
];
dlx.solve(matrix); //=> [[1, 3, 5]]
This project is distributed under the MIT license.