fkt

We have hosted the application fkt in order to run this application in our online workstations with Wine or directly.

Quick description about fkt:

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.

Audience: Science/Research.

Programming Language: Forth.

.