Analyzed
1 day
ago.
based on code collected
1 day
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.
In a Nutshell, fkt...
- ...
- ...
- ...
-
...
took an estimated 2 years of effort (COCOMO model)
starting with its first commit in December, 2011
ending with its most recent commit over 3 years ago
Quick Reference
http://svn.code.sf.net/p/fkt/cod...
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.
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
-
...
you can embed statistics from Open Hub on your site
30 Day SummaryAug 23 2017 — Sep 22 2017
|
12 Month SummarySep 22 2016 — Sep 22 2017
|
