Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!newsfeed.internetmci.com!EU.net!sun4nl!cs.vu.nl!mschule
From: mschule@cs.vu.nl (Matthijs)
Subject: REQ: shortest path algorithm 
Nntp-Posting-Host: sloep00.cs.vu.nl
Keywords: shortest path algorithm
Sender: news@cs.vu.nl
Organization: Fac. Wiskunde & Informatica, VU, Amsterdam
Date: Thu, 8 Feb 1996 11:49:07 GMT
X-Newsreader: TIN [version 1.2 PL2]
Message-ID: <DMGGtv.786.0.-s@cs.vu.nl>
Summary: shortest path algorithm
Lines: 29

Hello,

I'm looking for a shortest path algorithm which I can use in a game.
The goal of the game is to stay out of the hands of the police while
your moving across a network. 
- The network exists of 200 nodes,
- undirected edges between those nodes (some nodes have over 13 edges)
- the edges have all the same costs (cost 1)

My questions are: 
Does someone already has implemented dijkstra's algorithm? 
Is it possible to receive this code (and the data structures) 
in c++ or pascal? 
Is there an url-adress where i can find the code?

THANKS!!!

Matthijs Schulenklopper

PS.  to get an impression of (a part from) the network you can look at:
     http://www.cs.vu.nl/~aavande/synopsis.html
     (only one disadvantage: the language used is dutch. but the pictures
      speak for themselves)

______________________________________________________________________
Matthijs Schulenklopper                   Vrije Universiteit Amsterdam
email: mschule@cs.vu.nl                   Bedrijfsinformatica
 

