FKT Icon

FKT

alpha

Count perfect matchings in planar graphs.

Add a Review
1 Download (This Week)
Last Update:
Download fkt-0.1.3.tar.gz
Browse All Files
Windows Linux

Description

This project provides an implementation of the FKT algorithm to count the number of perfect matchings in a planar graph. The source code is written in the Forth language, requiring Gforth to run. Computations can be perfored via a command line tool as well as via a library usable with Gforth.

FKT Web Site

Update Notifications





Write a Review

User Reviews

Be the first to post a review of FKT!

Additional Project Details

Intended Audience

Science/Research

Programming Language

Forth

Registered

2011-12-27
Screenshots can attract more users to your project.
Features can attract more users to your project.

Icons must be PNG, GIF, or JPEG and less than 1 MiB in size. They will be displayed as 48x48 images.