Abstract: It is presented a new algorithm to find the minimum spanning tree on the basis of the pulse parallel transmission characteristic of DPCNN(Delay Pulse Coupled Neural Network).According to the character of the minimum spanning tree,the minimal weight summation and connectivity,algorithm combines DPCNN together and finds the shortest path of undirected weighted graph,then judges the connectivity.By the iterative method,this algorithm can be used to find the minimum spanning tree of undirected weighted graph.Finally,it is given the simulation experiment to show its availability.Therefore,it is clear that it is more advantageous than the traditional ways.