From 94d261906570f5528256e2ddceaa4a8822398efe Mon Sep 17 00:00:00 2001 From: jwansek Date: Tue, 9 Feb 2021 23:48:23 +0000 Subject: updated readme --- README.md | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) (limited to 'README.md') diff --git a/README.md b/README.md index 8602009..249eb3c 100644 --- a/README.md +++ b/README.md @@ -1,2 +1,18 @@ # Quine-McCluskey An implementation of the Quine-McCluskey algorithm to simpily a DNF written in C + +## How it works: +1. Parse the input (the sum of products) into a format we can use, nested structs +2. Create the simplification table of minterms +3. Merge minterms if possible, marking them if merged +4. Keep merging until we can't any more +5. Get what we couldn't merge, the 'Prime Implicants'- this is the output + +## Example +`./quineMcCluskey -C-B-A + -CB-A + C-B-A + CB-A + CBA` + +`-A + CB` + +(Alternative output format:) + +`A v (C ∧ B)` -- cgit v1.2.3