Employing Kruskal's method for assignment problem

The Assignment problem is really considered really very important, which assigns a set of n distinct jobs to n machines such that, the total cost is minimum. The problem is solved by many methods, one of them is the Hungarian's method. This research deals with graphs by proposing a new method which deals with complete bipartite graph using Kruskal's method. We compare the results for different problems which give optimal solution in both methods, but the new method gives a high degree of success and its easy to use.