import math, numpy
 
def process_block(block):
   numNodes=output.GetNumberOfPoints()
   #print numNodes
   #print dir(output)
   x=zeros( (numNodes,1),dtype=float )
   y=zeros( (numNodes,1),dtype=float )
   z=zeros( (numNodes,1),dtype=float )
   pts=output.GetPoints()
   x = pts[:,0]
   y = pts[:,1] 
   z = pts[:,2]
   #print dir(x)
   print x[0]
   min_dist=zeros( (numNodes,1),dtype=float)
   for node in range(numNodes): 
      dist=zeros( (numNodes,1),dtype=float )
      dist[node]=900.0     
      print min_dist[node] 
      xx=(x[node])
      print xx
      for inner in range(numNodes):
         if (inner != node):
            distance    = ( ( (x[node]-x[inner])**2+
                              (y[node]-y[inner])**2+
                              (z[node]-z[inner])**2  )**.5)  
            print distance
            fdistance=float(distance)
            dist[inner]=fdistance
            #dist=map(float,distance)
            #print distance 
            if dist[inner] < min_dist[node]:
            #   continue  
               print dist[0]
               #print dir(min_dist)
               #min_dist[node]=distance
            #else:
               #print "not min"
      #min_dist[node]=dist.min()
      #print dist.min()
   #block.PointData.append(min_dist,"Min_distance")

for block in output:
   process_block(block)