From: "Alex R. Mosteo" <devnull@mailinator.com>
Subject: Dijkstra's algorithm
Date: Mon, 13 Feb 2006 18:40:03 +0100
Date: 2006-02-13T18:40:03+01:00 [thread overview]
Message-ID: <43F0C473.5070409@mailinator.com> (raw)
Hi,
I'm looking for the shortest path Dijkstra's algorithm implemented in
Ada. The closest thing I've found are the mw_componentes, which sadly
have a raise Not_Yet_Implemented in the body of the interesting function ;)
Some suboptimal weighted shortest path algorithm could be of use, if it
isn't too suboptimal.
I'll be very grateful for any pointers.
reply other threads:[~2006-02-13 17:40 UTC|newest]
Thread overview: [no followups] expand[flat|nested] mbox.gz Atom feed
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox