A clustering and data-reorganizing algorithm based on the concept of the shortest spanning path of a graph is given. This algorithm can be used to reorganize and/or cluster a large file of data. © 1975, IEEE. All rights reserved.
