Abstract: Compared wi th the tradi tional algori thms of Prim and Kruskal, the new algori thm introduced in this paper has i ts own advantage. In the given network, find the edge of the ma ximal power and determinewhether there is another access which connects the two vertices of the edge , if there is, delete the edge, or remain i t. Search for the edge of the maximal power in the rest edges and deal wi th i t similarly. Repeat this procedure until the amount of edges in the network is equal to that of the vert ices minus one. By this way the minimal tree is produced

Key words: a minimal produced tree, network, power, connect