Open vedant-jain03 opened 3 years ago
MST is a tree which has no cycle and minimum wieghted edge
Algo to implement MST:
Sort according to wieght; Using DSU try to find that respective edge form a cycle or not if not add the edge.
Hello... I have added Kruskal's algorithm in java and created a pull request. Please do consider my pull request.
MST is a tree which has no cycle and minimum wieghted edge
Algo to implement MST:
Sort according to wieght; Using DSU try to find that respective edge form a cycle or not if not add the edge.