Shortest (cheapest) Path Analysis
=================================

This directory contains some utilities for shortest path analysis
and polygon building (topol was written by P. van Oosterom).

See the directory ../demos/{geoville,netherlands} for examples !!!


The cpath programma reads from standard input lines describing the edges.
Each input line has the following format:

oid	start_point	end_point	length

oid:		an integer identifier.
start_point:	a string describing the start point of the edge.
end_point:	a string describing the end point of the edge.
length:		the length of the edge.

cpath takes two command line parameters: the oid of the start edge and
the oid of the end edge. The program outputs the oids of the edges
which compose the shortest path on the file "oids_out".

"findpath" is an example wrapper for "cpath".
"PathMenu.c" implements a dynamic menu entry.


The subdirectory "prolog" contains (c)prolog equivalents.