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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4492ca3223e4184
X-Google-Attributes: gid103376,public
From: G <gmw@interact.net.au>
Subject: Re: Shortest path between two points of a graph
Date: 2000/02/17
Message-ID: <38AA9FD2.F47D9532@interact.net.au>#1/1
X-Deja-AN: 586502574
Content-Transfer-Encoding: 7bit
References: <87qddp$t13$1@bw107zhb.bluewin.ch> <87sb6o$nc3$1@nnrp1.deja.com>
X-Accept-Language: en
Content-Type: text/plain; charset=us-ascii
X-Complaints-To: abuse@interact.net.au
X-Trace: news.interact.net.au 950706183 203.56.111.143 (Thu,
 17 Feb 2000 00:03:03 EST)
Organization: ...
MIME-Version: 1.0
NNTP-Posting-Date: Thu, 17 Feb 2000 00:03:03 EST
Newsgroups: comp.lang.ada
Date: 2000-02-17T00:00:00+00:00
List-Id: <comp.lang.ada>

ASSET_A_230

If you can find that file on asset.com, you will find implementations in
Ada95 of the
algorithm in 2 and 3-dimensional spaces.


-G.