| 复杂网络的优化模型及最短路径求解 |
| |
| 引用本文： | 刘彦良,王鹏涛.复杂网络的优化模型及最短路径求解[J].天津理工大学学报,2006,22(1):33-35. |
| |
| 作者姓名： | 刘彦良 王鹏涛 |
| |
| 作者单位： | 天津理工大学,计算机科学与工程系,天津,300191 |
| |
| 基金项目： | 天津市高等学校科技发展基金 |
| |
| 摘 要： | 对大型复杂网络提出网络分级的思想，根据网络分级的情况定义网络结点的数据结构，然后使用改进的Dijkstra算法和最小生成树算法来计算网络中任意两结点之间的最短路径．
|
| 关 键 词： | 网络优化 最短路径 Dijkstra算法 |
| 文章编号： | 1673-095X（2006）01-0033-03 |
| 收稿时间： | 2005-10-31 |
| 修稿时间： | 2005年10月31 |
Optimization model of complicated network and shortest path algorithm |
| |
| LIU Yan-liang,WANG Peng-tao.Optimization model of complicated network and shortest path algorithm[J].Journal of Tianjin University of Technology,2006,22(1):33-35. |
| |
| Authors: | LIU Yan-liang WANG Peng-tao |
| |
| Institution: | Department of Computer Science and Engineering, Tianjin University of Technology, Tianjin 300191, China |
| |
| Abstract: | After bringing out the classification of large complicated network to optimize network, so the network can be divided some subnetwork. Basing the case of classification to define the data structure of the node, then using improved Dijkstra algorithm and minimum spanning trees algorithm,the shortest path between two nodes in the complicated network can becalculated. |
| |
| Keywords: | network optimize shortest path Dijkstra algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
