Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!udel!gatech!swrinde!cs.utexas.edu!news.cs.utah.edu!emba-news.uvm.edu!mwiggett
From: mwiggett@emba-news.uvm.edu (Mathew D. Wiggett)
Subject: Shortest Route
Message-ID: <1995Apr18.002148.13560@emba.uvm.edu>
Sender: news@emba.uvm.edu
Organization: EMBA Computer Facility, University of Vermont
X-Newsreader: TIN [version 1.2 PL2]
Date: Tue, 18 Apr 1995 00:21:48 GMT
Lines: 20

	Hi all...I didn't say anything before now because I thought
that this was something that everyone had already picked up.  I'll
be glad to throw together something pretty detailing shortest route
algorithms for both unweighted and weighted graphs (the data structure
that works best for this kind of work)  For those of you that need
some examples, an unweighted graph might be the computer representation
of a simple maze, while a weighted graph could be the representation
of a game board with the weights being...say, the number of armies
per space.  As I said before, if it hasn't already been done, I'll
do it, and this would probably make an excellent addition to the faq.
			-Just my buck-seventy-five (inflation)
			 Matt

--
--
*******************
forgetting the past
ignoring the future
living the present.
*******************
