Jogging with APL along the shortest path
Moshe Sneidovich, Suzanne Findlay · 1992
In this paper we examine the classical shortest path problem and illustrate the modelling issues involved in formulating APL codes for a number of generalizations thereof, including multiobjective problems. We also comment on APL's ability to cope with algorithms of this type.