New Research: Supply Chain Attack on Axios Pulls Malicious Dependency from npm.Details
Socket
Book a DemoSign in
Socket

dlx

Package Overview
Dependencies
Maintainers
1
Versions
4
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

dlx

Knuth's Dancing Links algorithm for the exact cover problem

latest
Source
npmnpm
Version
0.2.1
Version published
Weekly downloads
5.6K
-0.43%
Maintainers
1
Weekly downloads
 
Created
Source

dlx

An implementation of Knuth's Dancing Links algorithm for the exact cover problem. Many combinatoric problems, such as Sudoku and N-queens, can be reduced to exact cover problems and solved with the same algorithm.

Given a two-dimensional array of booleans, the problem is to select a subset of the rows that sums to [1, 1, 1, ..., 1]. In other words: for every column of the matrix, exactly one of the chosen rows must contain a one.

Usage:

var dlx = require("dlx");
var problem = [
	[0, 0, 1, 0, 1, 1, 0],
	[1, 0, 0, 1, 0, 0, 1],
	[0, 1, 1, 0, 0, 1, 0],
	[1, 0, 0, 1, 0, 0, 0],
	[0, 1, 0, 0, 0, 0, 1],
	[0, 0, 0, 1, 1, 0, 1],
];

var solutions = dlx.solve(problem);
// solutions is [[0, 3, 4]]

Run tests:

$ npm install
$ npm test

See more:

  • Dancing Links on Wikipedia
  • Knuth's paper (PDF)

Keywords

dancing links

FAQs

Package last updated on 28 May 2013

Did you know?

Socket

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install

Related posts