[Home] . . . Search by [Problem] [Package] [Name or Keyword] . . . [Math at NIST]

Module 595 in TOMS

General Information

HC: a Fortran subprogram for finding one or more Hamiltonian circuits in a directed graph. (See S. Martello, ACM TOMS 9 (1983) pp. 131-138.).

Usage
CALL HC (N, PR, AR, KW, NC, NB, S, N+1, PR(N+1), PC, AC, VR, VC, P, SUBR, RBUS, TOR)
Classification
PComputational geometry
Type
subroutine in TOMS package
Language
Fortran
Availability
Some uses prohibited, Portable
Precision
Single Precision

Download from NETLIB; Public access repository

Location
The University of Tennessee at Knoxville and Bell Laboratories
Contact
Jack Dongarra, ORNL (dongarra@cs.utk.edu) and Eric Grosse, Bell Labs (ehg@research.att.com)
Comments? gams@nist.gov