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 1 years of effort (COCOMO model)
starting with its first commit in December, 2011
ending with its most recent commit almost 7 years ago
Quick Reference
https://svn.code.sf.net/p/fkt/co...
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.
Project Security
Vulnerabilities per Version ( last 10 releases )
There are no reported vulnerabilities
Project Vulnerability Report
Security Confidence Index
Poor security track-record
Favorable security track-record
Vulnerability Exposure Index
Many reported vulnerabilities
Few reported vulnerabilities
Did You Know...
-
...
55% of companies leverage OSS for production infrastructure
-
...
search using multiple tags to find exactly what you need
-
...
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 SummaryMar 12 2021 — Apr 11 2021
|
12 Month SummaryApr 11 2020 — Apr 11 2021
|
