In order to solve the cluster set problems in identification of environmental background values, a rapid and simple algorithm. the method of minimum spanning tree, is presented in this paper. The similar relation of sample variables is described with x2 distance coefficient matrix, and the minimum spanning tree is drawn in accordance with Kruskal method. The classified results by the algorithm are shown in a graph form. In this paper an applied case has also been given.
