Module 595 in TOMS

• TOMS Information

• Components
  • Fullsource from NETLIB

595

 
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.).
 
Classes  :  P . Computational geometry (search also classes G and Q)
 
Type     : Fortran software in TOMS collection.
Access   : Some uses prohibited. Portable.
Precision: Single.
 
Usage    : CALL HC (N, PR, AR, KW, NC, NB, S, N+1, PR(N+1), PC, AC, VR, VC, P, SUBR,
           RBUS, TOR)
 
Details  : Fullsource
Sites    : (1) NETLIB
 

Implementation of 595 from TOMS on NETLIB

 
NETLIB:    Public access repository, The University of Tennessee at
           Knoxville and Bell Laboratories
 
Precision: Single.
 
You may access components from NETLIB outside GAMS as follows.
 
   Fullsource   : echo "send 595 from toms" | mail netlib@ornl.gov