0
I Use This!
Inactive
Analyzed 13 days ago. based on code collected 13 days ago.

Project Summary

An implementation of the FKT algorithm for counting the number of perfect matchings in a graph. Written using the Gforth programming language.

Tags

algorithms counting forth gforth graphtheoreticalproblems graphtheory lattices math

In a Nutshell, fkt...

GNU General Public License v3.0 or later
Permitted

Commercial Use

Modify

Distribute

Place Warranty

Use Patent Claims

Forbidden

Sub-License

Hold Liable

Required

Distribute Original

Disclose Source

Include Copyright

State Changes

Include License

Include Install Instructions

These details are provided for information only. No information here is legal advice and should not be used as such.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    by exploring contributors within projects, you can view details on every commit they have made to that project
  • ...
    there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
  • ...
    compare projects before you chose one to use

Languages

Languages?height=75&width=75
F#
97%
3 Other
3%

30 Day Summary

Nov 3 2017 — Dec 3 2017

12 Month Summary

Dec 3 2016 — Dec 3 2017

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!