SAWdoubler: A program for counting self-avoiding walks

This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018) Abstract This article presents SAWdoubler, a package for counting the total number Z N of self-avoiding walks (SAWs) on a regular lattice by the length-doubling method, of which the basic concept has been published previously by us. We discuss an algorithm for the creation of all SAWs of length N , efficient storage of these SAWs in a tree data structure, and an algorithm for the computation of correction terms to the count Z 2 N for SAWs of double length, removing all combinations of two intersecting... Title of program: SAWdoubler Catalogue Id: AEOB_v1_0 Nature of problem Computing the number of self-avoiding walks of a given length on a given lattice. Versions of this program held in the CPC repository in Mendeley Data AEOB_v1_0; SAWdoubler; 10.1016/j.cpc.2012.10.026本程序源自贝尔法斯特女王大学馆藏的CPC程序库（1969-2018） 摘要 本文介绍SAWdoubler，一款基于长度加倍法计算正则格点上自回避行走（self-avoiding walks, SAWs）总数量Z_N的软件包，其核心概念此前已由我们发表。本文讨论了生成指定长度N的全部自回避行走的算法、将这些自回避行走高效存储于树数据结构（tree data structure）的方法，以及针对双倍长度自回避行走的计数Z_{2N}计算修正项的算法，以移除两类相交的全部组合…… 程序标题：SAWdoubler 目录编号：AEOB_v1_0 问题本质：计算给定格点上指定长度的自回避行走的数量。 曼德雷数据（Mendeley Data）中CPC程序库内的本程序版本： AEOB_v1_0; SAWdoubler; 10.1016/j.cpc.2012.10.026