0
I Use This!
Inactive
Analyzed about 21 hours ago. based on code collected 2 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.

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
  • ...
    check out hot projects on the Open Hub
  • ...
    65% of companies leverage OSS to speed application development in 2016
  • ...
    compare projects before you chose one to use
About Project Security

Languages

Forth
98%
3 Other
2%

30 Day Summary

Feb 26 2024 — Mar 27 2024

12 Month Summary

Mar 27 2023 — Mar 27 2024

Ratings

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