14 Feb
2005
14 Feb
'05
5:52 p.m.
On Mon, 14 Feb 2005 12:27:51 -0500, robert dockins <robdockins@fastmail.fm> wrote:
[Dijkstra's] algorithm relies pretty fundamentally on mutability, which makes it a less than wonderful fit for a functional language. If you want to use this algorithm in particular, I would recommend a mutable array indexed on the vertex pair (u,v).
It is quite possible to implement the shortest path algorithm functionally even though it is not straight forward. See the following paper by Ralf Hinze: http://www.informatik.uni-bonn.de/~ralf/publications/ICFP01.pdf /Josef