Algorithm 422 Minimal Spanning Tree [H].

The article discusses an algorithm an algorithm that generates a spanning tree with minimal total edge length. It is stated that the technique discussed was first suggested by Dijkstra. The article details the representation of the inter-node edge length array and the impact this connection will have on the generation of spanning forest containing the minimal spanning trees. Also discussed is the data storage required for the algorithm.