     This directory contains the C version of the program to compute a
Rectilinear Steiner Minimal Tree for a given set of points.  To build the
programs, just type "make".  The resulting programs are:

		- main

		- rand_points

     The program "main" takes as input a sequence of X/Y pairs terminated
by End-Of-File.  Each coordinate is expected to be an integer in the range
from 0 to 9999.  Currently, it computes a Steiner Minimal Tree, a Minimum
Spanning Tree, and a Kahng-Robins tree.

This version contains the following changes:

	- Non-functional beginnings of generalized decomposition
	  stuff.  Uses new algorithm to find articulation points
	  quickly and directly from the compatibility matrix.  The
	  articulation points are printed, but nothing else is done
	  with them.

	- More thorough but MUCH SLOWER initial pruning (-i).

	- Display of full-sets in "topographical relief map"
	  form (-r).

	- Display of individual full-sets as splitting pieces
	  (-s).

     The relief map is obtained by specifying the -r switch, and the
splitting pieces by specifying the -s switch.

     The program "rand_points" generates random point sets for the first
program.  Usage is:

	rand_points [-flags] [size]

where size is the number of points to generate (10 by default).  The flags
recognized are:

		-e	Display seed value on stderr.

		-o	Display seed value on stdout.

		-r	Uses a seed derived from the current time.

		-sX	Uses X as the initial seed (default is -s 1).


A typical test run might be as follows:

	rand_points -r 50 | main
