Dear User:

Here is the bds c-program software.   

All c source is contained in the file bdstest.c.  This file
contains the main subroutines for calculations and an easy to
use main program that calls them.  Casual users may just want
to compile the program using the file mbdstest.  It requires the
standard unix math library, but that is its only unusual feature.

Advanced users and people doing simulations may want to strip
off the main program and use the subroutines on their own.  When
the main program is removed (the source makes it clear how to
do this) the remaining text can be compiled as a seperate subroutine
library to be called by outside programs.

Also included is source code for a slower algorithm 
fkc_slow.  This runs much slower, is simpler, and uses
less memory.


An example data set is included called input.  To test the program
type 
bdstest input 5 0.5

This should produce output which looks like the file labeled output.

Lots of room for more play and improvement.
The complexity of the algorithm
is mainly for speed purposes.  Its main purpose is still simple
counting of close neighbors.  Users interesting in understanding
the inner workings may want to start with the slow algorithm
first. 

 

Blake LeBaron
Brandeis University
4/2002