In 1983, Lehert provided original contributions to the theory of algorithm complexity in pattern recognition and artificial intelligence in demonstrating that the computational complexity of the minimum spanning tree and connected components clustering was bounded by a linear O(n) expected time in proving an upper bound related with the density of first passage percolation in P-dimensional Euclidian spaces based on Square lattice for any Minkowsky distance (references 3,5,6,7,9,11,13,21, 57,62,104).