@aureooms/js-sat

v2.0.2

Boolean formula satisfiability algorithms for JavaScript

NPM

README

GitHub

Website

AGPL-3.0

Latest version published 4 years ago

    npm install @aureooms/js-sat

We couldn't find any similar packages Browse all packages

Package Health Score

47 / 100

Popularity
Limited
Maintenance
Inactive
Security
No known security issues
Community
Limited

Make sure the open source you're using is safe to use

Secure my Project

Popularity

Limited

Weekly Downloads (3)

Dependents: 0
GitHub Stars: 3
Forks: 0
Contributors: 5

The npm package @aureooms/js-sat receives a total of 3 downloads a week. As such, we scored @aureooms/js-sat popularity level to be Limited.

Based on project statistics from the GitHub repository for the npm package @aureooms/js-sat, we found that it has been starred 3 times, and that 0 other projects in the ecosystem are dependent on it.

Downloads are calculated as moving averages for a period of the last 12 months, excluding weekends and known missing data points.

Security

No known security issues

Security and license risk for significant versions

All Versions

Direct Vulnerabilities

1.1.1

2.0.2

Indirect Vulnerabilities

1.1.1

2.0.2

License Risks

1.1.1

2.0.2

All security vulnerabilities belong to production dependencies of direct and indirect packages.

License

AGPL-3.0

Non-Permissive License

We noticed that this project uses a license which requires less permissive conditions such as disclosing the source code, stating changes or redistributing the source under the same license. It is advised to further consult the license terms before use.

Security Policy

We found a way for you to contribute to the project! Looks like @aureooms/js-sat is missing a security policy.

Snyk detected that the latest version of @aureooms/js-sat has a security vulnerability.

We highly advise you to review these security issues.

You can connect your project's repository to Snyk to stay up to date on security alerts and receive automatic fix pull requests.

We found a way for you to contribute to the project! Looks like @aureooms/js-sat is missing a security policy.

    # Install the Snyk CLI and test your project
npm i snyk && snyk test @aureooms/js-sat

Keep your project free of vulnerabilities with Snyk

Maintenance

Inactive

Commit Frequency

Open Issues: 1
Merged PR: 55
Open PR: 0
Last Commit: 20 days ago

Further analysis of the maintenance status of @aureooms/js-sat based on released npm versions cadence, the repository activity, and other data points determined that its maintenance is Inactive.

An important project maintenance signal to consider for @aureooms/js-sat is that it hasn't seen any new versions released to npm in the past 12 months, and could be considered as a discontinued project, or that which receives low attention from its maintainers.

As a healthy sign for on-going project maintenance, we found that the GitHub repository had at least 1 pull request or issue interacted with by the community.

Community

Limited

Readme.md: No
Contributing.md: No
Code of Conduct: No
Contributors: 5
Funding: No

This project has seen only 10 or less contributors.

We found a way for you to contribute to the project! Looks like @aureooms/js-sat is missing a Code of Conduct.

How about a good first contribution to this project? It seems that @aureooms/js-sat is missing a README file.

Embed Package Health Score Badge

Package

Node.js Compatibility: not defined

Age: 4 years
Dependencies: 1 Direct / 3 Total
Versions: 5
Install Size: 0 B
Dist-tags: 1
# of Files: 0
Maintainers: 1
TS Typings: No

We detected a total of 3 direct & transitive dependencies for @aureooms/js-sat. See the full dependency tree of @aureooms/js-sat

@aureooms/js-sat has more than a single and default latest tag published for the npm package. This means, there may be other tags available for this package, such as next to indicate future releases, or stable to indicate stable releases.

@aureooms/js-sat

Boolean formula satisfiability algorithms for JavaScript. See docs. Parent is @aureooms/js-algorithms. For a polynomial time algorithm for the 2SAT problem see @aureooms/js-2sat.

let instance = sat.from.signs( [ [ -1 , 2 , 3 ] , [ -2 , -4 , 5 ] , [ 1 , -5 ] ] ) ;
// or
// let instance = sat.from.keys(
// [
//   [ [ false , '1' ] , [ true , '2' ] , [ true , '3' ] ] ,
//   [ [ false , '2' ] , [ false , '4' ] , [ true , '5' ] ] ,
//   [ [ true , '1' ] , [ false , '5' ] ]
// ]
// ) ;
sat.decide( instance ) ; // true
sat.verify( instance , sat.solve( instance ).next( ).value ) ; // true
for ( let certificate of sat.solve( instance ) ) {
    console.log( instance.assignment( certificate ) ) ;
}