论文部分内容阅读
本文阐述了“节点活动法”网络中时间计算与相容鉴定之间的内在逻辑关系,并运用邻接矩阵与可达性矩阵的运算和划分发展了一种综合算法。如果网络中存在任何不相容的因素,算法将提供包含在循环中的活动的差错信息。如果网络是相容的,则算法将提供所有的时间参数。由于综合算法使时间计算和相容鉴定同时进行,这可以使网络软件系统更为有效从而节省计算机机时。综合算法还能提供网络的正向和反向等级划分,这对工程网络的结构分析将是十分有益的。
In this paper, we elaborate on the inherent logical relationship between time computation and identity verification in the “node activity method” network and develop a comprehensive algorithm by using the adjointness matrix and the operation and division of reachability matrix. If there are any incompatible factors in the network, the algorithm will provide error information about the activities contained in the loop. If the network is compatible, the algorithm will provide all the time parameters. Because of the combined algorithms that allow time and compatible evaluations to be performed simultaneously, this can make networked software systems more efficient and save on computer time. Synthesis algorithm can also provide the network forward and reverse hierarchical division, the structural analysis of the engineering network will be very useful.