comp.lang.ada
 help / color / mirror / Atom feed
* Dijkstra's algorithm
@ 2006-02-13 17:40 Alex R. Mosteo
  0 siblings, 0 replies; only message in thread
From: Alex R. Mosteo @ 2006-02-13 17:40 UTC (permalink / 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.



^ permalink raw reply	[flat|nested] only message in thread

only message in thread, other threads:[~2006-02-13 17:40 UTC | newest]

Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2006-02-13 17:40 Dijkstra's algorithm Alex R. Mosteo

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox