Introduction - If you have any usage issues, please Google them yourself
Kruskal Algorithm used to solve assignment problem minimum spanning tree (assignment problem), a manager of the company prepare arrangements for employees to complete tasks, each one. As a result of the characteristics of different staff, different staff to accomplish the same mission when the return is different. How to allocate the work program can make the greatest total return?
Packet : 45666031yuanma.rar filelist
yuanma.m
图与网络模型及方法.doc