| 基于模糊费用最小生成树问题的算法设计 |
| |
| 引用本文： | 罗世亮.基于模糊费用最小生成树问题的算法设计[J].赣南师范学院学报,2007,28(3):38-40. |
| |
| 作者姓名： | 罗世亮 |
| |
| 作者单位： | 赣南师范学院,数学与计算机科学学院,江西,赣州,341000 |
| |
| 摘 要： | 考虑到通信网络系统架设费用存在着不确定性,针对修建费用为模糊数的最小生成树问题,本文根据改进的PR IM算法得到通信网络系统中关于模糊费用的一棵最小生成树.这种新算法充分考虑了架设费用的模糊性,它的时间复杂度为O(n2).
|
| 关 键 词： | 模糊费用 最小生成树 PRIM算法 |
| 文章编号： | 1004-8332（2007）03-0038-03 |
| 收稿时间： | 2007-04-05 |
| 修稿时间： | 2007-04-052007-04-26 |
Algorithm Design Based On Fuzziness Expenses Problem of the Minimum Born Tree |
| |
| LUO Shi-liang.Algorithm Design Based On Fuzziness Expenses Problem of the Minimum Born Tree[J].Journal of Gannan Teachers' College(Social Science(2)),2007,28(3):38-40. |
| |
| Authors: | LUO Shi-liang |
| |
| Institution: | School of Mathematic and Computer Science, Gannan Normal University, Ganzhou 341000,China |
| |
| Abstract: | Considering the uncertainty during the mounting of the communication-network system,the article obtains the minimum born tree according to the improved prim algorithm.This new algorithm has fully considered the fuzziness of the mounting expenses and its time complexity is O(n2). |
| |
| Keywords: | fuzziness expenses the minimum born tree prim algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
