Re: Shortest Path Algorithm

[Andre Costa]

On Fri, 26 May 2000, Krishnan Viswanathan wrote:

> If anyone has implemented a shortest path algorithm in Swarm I would 
> appreciate it if you could give me pointers on implementing it.

I have written code for Dijkstra's algorithm using the Java interface. The
algorithm is written as a method of a basic "network" class which reads
in a 0-1 "topology" matrix from a text file. The Dijkstra method returns
the cost/delay value of the shortest path between any two nodes, but does 
not specify the actual path(s) in terms of an ordered set of nodes. I can
clean it up and mail the code to you if this will be useful.

Cheers,
Andre

---------------------------------------------------------------------
Andre Costa
Research Student

Teletraffic Research Centre           Telephone: (08) 8303 3237
Department of Applied Mathematics     Fax:       (08) 8303 4395
University of Adelaide                Email:address@hidden
South Australia  5005
----------------------------------------------------------------------




                  ==================================
   Swarm-Modelling is for discussion of Simulation and Modelling techniques
   esp. using Swarm.  For list administration needs (esp. [un]subscribing),
   please send a message to <address@hidden> with "help" in the
   body of the message.
                  ==================================