Directory contains:

make_graph.sc:  routines for generating a random graph.  The graph
types include 2D and 3D lattices (with missing edges) and a tertiary
graph where every vertex has an average of 3 random neighbors.

local.sc:  routines for local dfs/bfs.

local.old.sc:  version of local.sc used for getting performance measurements
for the supercomputing paper; had a minor bug in the sequential code which
made sequential execution times include some work necessary only for the
parallel algorithm, thereby increasing speedups by about 2-3%.

find_comp.sc:  the global portion of the hybrid algorithm.

Arguments:
connect -t $type -s $seed -% $percent -p $procs -n $nodes

$type = {2,3,t}
$seed = random seed
$percent = percentage of edges in a lattice
$procs = number of processors
$nodes = side of a lattice owned by a processor for 2D/3D graph 
	OR number of vertices on a processor for a tertiary graph