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.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: 103376,6cd1ba17bc175268,start
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news3.google.com!news.glorb.com!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: "Alex R. Mosteo" <devnull@mailinator.com>
Newsgroups: comp.lang.ada
Subject: Dijkstra's algorithm
Date: Mon, 13 Feb 2006 18:40:03 +0100
Message-ID: <43F0C473.5070409@mailinator.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: individual.net rm8U5ejIeqNlIJCdb8Kz7AI1swTkFnKOipHTFZVSoBNC4Coc8=
User-Agent: Mozilla Thunderbird 1.0.7 (X11/20051013)
X-Accept-Language: en-us, en
Xref: g2news1.google.com comp.lang.ada:2875
Date: 2006-02-13T18:40:03+01:00
List-Id: <comp.lang.ada>

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.