From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,b30ba7967a3c7011
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Ada package for linear assignment problem
Date: 1997/04/01
Message-ID: <dewar.859944911@merv>#1/1
X-Deja-AN: 230023273
References: <3341630F.41C67EA6@digicomp.com>
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-04-01T00:00:00+00:00
List-Id: <comp.lang.ada>


Jan asks

<<Does anyone know of an Ada version for the Carpaneto and Toth
Algorithm 548 (ACM TOMS) that solves the linear assignment
problem?  The original was reported in FORTRAN and could be
recoded, but...>>

Why not just use the Fortran version, and interface to it? It always
seems to me to be an error-prone waste of time to convert things to
Ada just for the sake of convesion.