
%   run a random walk on a square grid for n steps
%   and compute graph of connected components under 
%   edge adjaceny. Color components according to 
%   graph distance from unbounded component.

function comps_graph(n)
  close all
  tic
  [dir_edges,out_list,verts]=make_trace(n)
  [dist,norm_diam]=find_comps(dir_edges,out_list,verts,n,10);
  return
