|
QCMP101. Hamiltonian Paths in Polyhexes
by E. C. Kirby, Resource Use Institute, Pitlochry, Perthshire PH16 5DS, Scotland This offering consists of a group of three programs which embody different methods for searching polyhexes for Hamiltonian paths or circuits. A Hamiltonian path is one that can be traced through a network of points (a graph) and touching all points while visiting each vertex (point) only once. A Hamiltonian circuit is just such a path. The famous "traveling salesman" problem assumes that such a path exists and this in turn points to a possible coding methods such as the calculation of nuclear magnetic resonance-induced ring currents and the consideration of allowable results of linear polymer cross-linking processes. Lines of Code: 2307 Borland TurboBasic |