Minimum Spanning Tree

Minimum spanning tree (MST) is a subgraph of an undirected graph that is a tree with minimum weight and contains all vertices in the graph.  Direct application of minimum spanning tree is in the design of networks, covering computer networks, transportation nyetworks, telecommunication networks and electrical grids.

The only minimum spanning tree of a graph

Our implementation of minimum spanning tree is based on Pregel Computation model using our XPregel framework. Currently if there are many minimum spanning tree in the graph, only arbitrary one will be return.



 Minimum spanning tree 

 Calculating minimum spanning tree 

Download the ScaleGraph