cmu / ParallelMST / 0.1.0
This algorithm computes the minimum spanning tree of a graph using a parallel Kruskal's algorithm implementation. Currently it operates on some sample graphs uploaded to the Data API in the GML format, new data can be uploaded and the path can be given to the readGMLData function inside the source code.