Minimum spanning tree algorithm confined in conditions Click Copy

Minimum spanning tree algorithm confined in conditions

References:

[1]刘联会.通讯网络中的生成树[J].西安科技大学学报,1990,10(1):56-60.
LIU Lian-hui.Spinning tree in communication network[J].Journal of Xi'an University of Science and Technology,1990,10(1):56-60.
[2] 吴奉亮,常心坦,李龙清.多风机通风系统的网络图自动生成[J].西安科技大学学报,2006,26(3):293-295.
WU Feng-liang,CHANG Xin-tan, LI Long-qing.Automatic generation of network diagraph of ventilation system with several main fans[J].Journal of Xi'an University of Science and Technology,2006,26(3):293-295.
[3] Prim R C.Shortest connection networks and some generations[J].Bell System Tech,1957,36:1 389-1 401.
[4] Kruskal J B Jr. On the shortest spanning subtree of a graph and the salesman problem[J].Pro Amer Math Soc, 1956,7:48.
[5] [日]玄光男,程润传.遗传算法与工程设计[M].汪定伟,译.北京:科学出版社,2001.
Xuan G N,Cheng R W.Genetic algorithms and engineering design[M].Translated by Wang D W.Beijing:Science Press,2001.
[6] 钱颂迪.运筹学[M].北京:清华大学出版社,1990.
QIAN Song-di.Operation research[M]. Beijing: Tsinghua University Press,1990.
[7] 严蔚敏,吴伟民.数据结构[M].北京:清华大学出版社,1997.
YAN Wei-min,WU Wei-min.Data structure[M]. Beijing:Tsinghua University Press,1997.

Memo

基金项目: 国家自然科学基金资助项目(40572165); 陕西省教育厅专项科研计划项目(08JK354) 作者简介: 厍向阳(1968-),男,陕西周至人,博士,副教授,主要从事数据挖掘、人工智能、复杂系统理论等方面的研究.