设为首页 加入收藏 关闭窗口


Minimum Spanning Tree Algorithm Demo

1. The user manual
2. Draw the graph by clicking, dragging and entering weight
3. Gradually build up the U-set
4. Find out all connecting edges between the U-set and the V-set
5. Select a minimum edge and add its end node to the U-set
6. Go back one step
7. Keep expanding the U-set until all nodes are included
8. The final minimum spanning tree
9. About the software


设为首页 | 加入收藏 | 关闭窗口 
推荐使用IE5.0及以上浏览器,800*600及以上分辨率,24位真彩色设置浏览本站
2004年2月10日元镭制作(参考模板来源:www.mesky.net