摘要
图对同一个逻辑问题可有不同的表达方式，在必要时需进行逻辑同构变换￣［１］。本文对“节点型网络向箭线型网络的逻辑同构变换“的研究进行了补充，增加了三种情况的图形子模，进一步论证了逐节生长法的通用性。同时，提出了箭线型网络向节点型网络逆向变换的算法：逐线收缩法。文中通过简例，给出了用上述两种变换算法编制计算机程序获得的结果。
A logical problem can be described as different types of graph,between which the transfering is named the isomorphic logical transformation.It would be used in many application area as necessary.A complement study for″The tranformation from a network in object on the node to another in object on the arrow″(published in issue no,1,vol.3,1988,of the Journal)is provided by increasing three graph submodels and further proving the general suitability of the gradually growing nodes method.The gradually contracting arrow method is also presented for adverse transformation to foregoing one.A computerized illustration given here and a few project schedules has proved the correction of these algorithms.
出处
《系统工程学报》
CSCD
1995年第1期97-102,共6页
Journal of Systems Engineering
关键词
网络图
逻辑同构变换
网形子模
network,graphic submodel,logical isomorphism,transformation, set, searching
