Minimum spanning tree generation with content-addressable memory

An efficient parallel algorithm is proposed for finding a minimum spanning tree, with the aid of content-addressable memory. Operations such as minimum-value search and updating the active edges are implemented in an efficient manner. The algorithm has O(n) complexity, where n is the number of nodes. An example is given and compared with a conventional algorithm. Actual implementation shows approximately O(n) speedup.