复杂网络的分层递阶算法研究-电脑知识与技术 关键词：复杂网络；最小路集；分层递阶 [gap=1020]Key words: complex networks; minimal path sets; hierarchical algorithm
基于34个网页-相关网页
minimal path-sets 最小路集
The minimal path sets (MPS) are achieved by Boolean algebraic simplification calculation. The authors put forward the analyzing result of the structural significance of the basic event.
采用布尔代数化简法求出系统的最小径集，给出了事故树中基本事件的结构重要度分析结果。
Listing 1 echoes a message as the script begins and sets a minimal PATH variable.
清单1回应一条消息作为脚本的开始，并且设置最小限度的PATH变量。
应用推荐