The included files are the source code to the pathfinder algorithm program.
It features Floyd's and several variations of Dijkstra's algorithm. You
will need to compile it.

The *.nt0 files are the distance tables containing all the distances for
the nodes.  1618.nt0 is for 1618 nodes system.  To use this file, rename
it to distance.nt0.  This is the file the program will load.  The original
distance.nt0 contains only data for 256 nodes.  If no distance.nt0 is found,
the program will create one.  Distance.nt0 can be used as the "standard"
distance table for various "benchmarks" for any number of pathing
algorithms.  The distance.nt0 only contain distances for linked nodes.  It
is the "raw data" to be used for your benchmarks.

The node id are integer values while distances are all floats.  These
distances are then converted to double when values are loaded from file.
(On most machines, variables of type double execute faster than floats.)

The program is hard-coded for 256 nodes.  To use the 1618 node system,
you will need to change the value for MAX_NODES found in distance.h file.
Change the value from 256 to 1618.  Then compile.

Author   :  legion, legion@inside3d.com
Date     :  02/27/98

Credits  :  William van der Sterren (for the Dijkstra's algorithm)
            Terry Hendrix II (for ideas on file i/o)


