A FORTRAN program for cluster enumeration
- 86 Downloads
A simple FORTRAN program based primarily on the algorithm of Martin is presented for enumerating isolated connected clusters of up to a given specified number of particles on the square lattice. A brief explanation of the workings of the program is also provided to facilitate its use by those interested in this problem. To order 15, the program enumerates clusters at an average rate of approximately 63,000/sec when implemented on an IBM 370/168 with the extended optimizing compiler.
Key wordsCluster enumeration Martin algorithm FORTRAN program
Unable to display preview. Download preview PDF.
- 1.For extensive references on these fields, see e.g., D. Stauffer,Phys. Rep. 54:1 (1979); J. W. Essam,Rep. Prog. Phys. 43:833 (1980).Google Scholar
- 2.See, e.g., F. Harary, inGraph Theory and Theoretical Physics, F. Harary, ed., Academic Press, London (1967), pp. 1–41; D. A. Klarner,Can. J. Math. 19:851 (1967).Google Scholar
- 3.C. Domb,Philos. Mag. Suppl. 9:301 (1960).Google Scholar
- 4.M. F. Sykes and M. Glen,J. Phys. A: Gen. Phys. 9:87 (1976).Google Scholar
- 5.M. F. Sykes, D. S. Gaunt, and M. Glen,J. Phys. A: Gen. Phys. 9:1705 (1976).Google Scholar
- 6.D. S. Gaunt and H. Ruskin,J. Phys. A: Gen. Phys. 11:1369 (1978).Google Scholar
- 7.H. P. Peters, D. Stauffer, H. P. Hölters, and K. Loewenich,Z. Phys. B 34:399 (1979).Google Scholar
- 8.J. A. M. S. Duarte and H. Ruskin,Physica 111A:423 (1982).Google Scholar
- 9.J. L. Martin, inPhase Transitions and Critical Phenomena, Vol. 3, C. Domb and M. S. Green, eds., Academic Press, New York (1972), p. 97.Google Scholar