Cyclomatic complexity, pioneered during those studies I previously mentioned, precisely measures path complexity.
圈复杂度是在我前面提到的那些研究期间开创的，它可以精确地测量路径复杂度。
Several main considered parameters are average link clustering, number of multiple paths, path complexity factor, and hop difference factor.
几个考虑的主要参数有平均链路簇，多径数目，路径复杂度和跳数差别因子。
EESSPA algorithm can avoid the information explosion by distributed control. Its computation complexity is independent of the number of hops along the path.
EESSPA算法的特点是采用分布式控制，避免了由于集中式控制导致的信息爆炸，并且算法复杂度与途经链路数无关。
应用推荐