舰船电子工程2011，Vol.31Issue(11)：95-98,4.
一种有向概率图连通性仿真算法
A Simulation Algrithm for Connexity of Directed Probability Graph
马睿 1朱建冲1
作者信息
- 1. 海军工程大学管理工程系,武汉430033
- 折叠
摘要
Abstract
The analysis for connexity of graphs plays important roles in analysis for systematic reliability,systematic structural optimization etc.To analyze the connexity of directed probability graph,this paper proposes a simulation algrithm.The algorithm performs simulation by using MATLAB and GENIE,first it calculates the connective situation of network by MATLAB,receiving an interim result,then by inputing the interim result into GENIE,the algorithm can analyze the connective probability of directed graph,the connective probability of network when links fail,the fail rates of links when the network fails and perform sensitivity analysis based on independent fail rates of links.The simulation result indicates that the algorithm performs good on accuracy and speed and can be applied to directed probability graphs with complicated structures.关键词
图论/连通性/仿真算法Key words
graph theory/connexity/simulation algrithm分类
信息技术与安全科学引用本文复制引用
马睿,朱建冲..一种有向概率图连通性仿真算法[J].舰船电子工程,2011,31(11):95-98,4.
