aboutsummaryrefslogtreecommitdiffstats
path: root/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'README.md')
-rw-r--r--README.md16
1 files changed, 16 insertions, 0 deletions
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)`