Index: /issm/trunk/src/m/partition/adjacency_matrix.m
===================================================================
--- /issm/trunk/src/m/partition/adjacency_matrix.m	(revision 3005)
+++ /issm/trunk/src/m/partition/adjacency_matrix.m	(revision 3006)
@@ -28,4 +28,6 @@
 disp('Creating unique sorted vertex list.');
 vlist=unique(nonzeros(elem_con));
+fprintf('  Found %d vertices numbered from %d to %d.\n',...
+        length(vlist),vlist(1),vlist(end));
 
 %%  create edge list and vertex weights
@@ -44,4 +46,7 @@
 %  loop over elements
 
+fprintf('  Processing %d elements with a maximum of %d vertices.\n',...
+        size(elem_con,1),size(elem_con,2));
+hwbar=waitbar(0);
 for i=1:size(elem_con,1)
     elem=nonzeros(elem_con(i,:));
@@ -125,12 +130,23 @@
             error(['Unrecognized element of length' length(elem) '.']);
     end
-end
-
-disp(sprintf('Total area=%f; min area=%f, max area=%f, ratio=%f.',...
-             asum,amin,amax,amax/amin));
-disp(sprintf('Total volume=%f; min volume=%f, max volume=%f, ratio=%f.',...
-             vsum,vmin,vmax,vmax/vmin));
-disp(sprintf('Total weight=%f; min weight=%f, max weight=%f, ratio=%f.',...
-             sum(vwgt),min(vwgt),max(vwgt),max(vwgt)/min(vwgt)));
+    if (i/100 == floor(i/100))
+%         fprintf('  %d elements processed.\n',i);
+        waitbar(i/size(elem_con,1),hwbar,sprintf('%d elements processed.',i));
+    end
+end
+fprintf('  %d total elements processed.\n\n',i);
+waitbar(1,hwbar,sprintf('%d total elements processed.',i));
+close(hwbar)
+
+if (asum > 0)
+    fprintf('Total area=%f; min area=%f, max area=%f, ratio=%f.\n',...
+            asum,amin,amax,amax/amin);
+end
+if (vsum > 0)
+    fprintf('Total volume=%f; min volume=%f, max volume=%f, ratio=%f.\n',...
+            vsum,vmin,vmax,vmax/vmin);
+end
+fprintf('Total weight=%f; min weight=%f, max weight=%f, ratio=%f.\n',...
+        sum(vwgt),min(vwgt),max(vwgt),max(vwgt)/min(vwgt));
 
 elist=elist(1:nedge,:);
@@ -144,5 +160,4 @@
 %%  create adjacency matrix and make symmetric
 
-disp('Creating adjacency matrix.');
 adj_mat=sparse(elist(:,1),elist(:,2),1,length(vlist),length(vlist));
 adj_mat=double(adj_mat | adj_mat');