{"ref":"master","ref_type":"branch","master_branch":"master","description":"This project is about the Kruskal and Prim algorithms for finding the minimum spanning tree. GraphEditor library is used with some modifications. No external jars is needed","pusher_type":"user"}