Skip to main content

An implementation of the Quine-McCluskey algorithm

Project description

A Python implementation of the Quine McCluskey algorithm.

This implementation of the Quine McCluskey algorithm has no inherent limits (other than the calculation time) on the size of the inputs.

Also, in the limited tests of the author of this module, this implementation is considerably faster than other public Python implementations for non-trivial inputs.

Another unique feature of this implementation is the possibility to use the XOR and XNOR operators, in addition to the normal AND operator, to minimise the terms. This slows down the algorithm, but in some cases the result can be much more compact than a sum of product.

How to install qm.py

Install the package with

python setup.py install

This needs superuser privileges. If you want to install the package locally, you can run:

mypath=XXX PYTHONPATH=$mypath/lib/python2.7/site-packages/ python setup.py install –prefix $mypath

where XXX can be any path. You may have to change the PYTHONPATH according to your python version.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

quine_mccluskey-0.2.tar.gz (7.7 kB view details)

Uploaded Source

File details

Details for the file quine_mccluskey-0.2.tar.gz.

File metadata

File hashes

Hashes for quine_mccluskey-0.2.tar.gz
Algorithm Hash digest
SHA256 9b1458eeb9fffcf8202079874ed77d8de62110849afb85d289be23fae132dd0b
MD5 74f7e419de1f8fb2e5b4a41ad313e9d1
BLAKE2b-256 28b1d41dbf8a109c6d4c61966a27a18118cce9ff5fffd9a2d558c6b0d67a5f55

See more details on using hashes here.

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page