An implementation of the FKT algorithm for counting the number of perfect matchings in a graph. Written using the Gforth programming language.
Use Patent Claims
Include Install Instructions
These details are provided for information only. No information here is legal advice and should not be used as such.
There are no reported vulnerabilities