线性动态网络简化工具与种群协议模拟软件介绍
1. LNetReduce:线性动态网络简化工具
1.1 算法概述
LNetReduce 是用于简化线性动态网络的工具。恢复操作的结果与路径无关,可从层次结构中最紧凑或不太紧凑的循环开始。其顶层算法如算法 1 所示:
Algorithm 1. Reduce
Require: labeled digraph G
Ensure: reduced labeled digraph
if condition 1 then
Prune, compute auxiliary deterministic graph;
else
break
end if
Ncycles:= number of cycles;
while Ncycles > 1 do
Compute disjoint, irreducible cycles;
if condition 2 then
Glue cycles;
if condition 1 then
Prune, compute auxiliary deterministic graph;
else
break
end if
else
break
end if
Ncycles:= number of cycles;
end while
Restore glued vertices;
若条件 1 和条件 2 处处满足,则简化后的图是
超级会员免费看
订阅专栏 解锁全文
1381

被折叠的 条评论
为什么被折叠?



