Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!taurus.bv.sgi.net!imci3!newsfeed.internetmci.com!torn!watserv3.uwaterloo.ca!cnts5p16.uwaterloo.ca!user
From: smmcdowe@undergrad.math.uwaterloo.ca (Sean McDowell)
Subject: Re: Anybody experienced with the A* algorithm?  -  alg.txt [1/1]  -  alg.txt [1/1]
Message-ID: <smmcdowe-2008962257080001@cnts5p16.uwaterloo.ca>
Sender: news@watserv3.uwaterloo.ca
Nntp-Posting-Host: cnts5p16.uwaterloo.ca
Organization: University of Waterloo
X-Newsreader: Value-Added NewsWatcher 2.0b24.0+
References: <4v1gos$qf5@willow.cc.kcl.ac.uk> <01bb8b81$0679aca0$2fee60ce@speedy.imagicgames.com> <smmcdowe-2008961649380001@cnts2p28.uwaterloo.ca>
Date: Wed, 21 Aug 1996 02:58:44 GMT
Lines: 18

Small correction, and I apologize for the lack of text wrapping, I had
turned it off so code comments wouldn't wrap and my message didn't either
:-)

In article <smmcdowe-2008961649380001@cnts2p28.uwaterloo.ca>,
smmcdowe@undergrad.math.uwaterloo.ca (Sean McDowell) wrote:

The algorithm for doing this is a variation of Prim's algorithm which is
another algorithm to find a minimum-weight spanning tree. All you need to
implement it is a stack. However, the algorithm requires the ability to
detect when a cycle 
     ^
     |--QUEUE, not stack
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Sean McDowell                  "We should not let ourselves be burnt for
3N CS, U of Waterloo            our opinions: we are not that sure of them.
smmcdowell@undergrad.math.      But perhaps for this: that we may have and
uwaterloo.ca                    change our opinions." -- Nietzsche
