Key points are not available for this paper at this time.
The computer code for Mehta and Patel's (1983) network algorithm for Fisher's exact test on unordered r×c contingency tables is provided. The code is written in double precision FORTRAN 77. This code provides the fastest currently available method for executing Fisher's exact test, and is shown to be orders of magnitude superior to any other available algorithm. Many important details of data structures and implementation that have contributed crucially to the success of the network algorithm are recorded here.
Mehta et al. (Sun,) studied this question.