First of all, this paper gives a definition of the unique shortest chain graph (U. S. C. graph).
本文首先把图中任二点之间的最短链仅有一条者定义为唯一最短链图。
The output of the algorithm is largest chain graph, which just orienting the statistical distinguishable edges, keep the indistinguishable edges undirected.
算法输出结果为最大链图，该图仅对统计可分的弧进行定向，对统计不可分的弧保留无向的特性。
The output of the algorithm is largest chain graph, which just orienting the statistical distinguishable edges, keep the indistinguishable edges undirected.
算法输出结果为最大链图，该图仅对统计可分的弧进行定向，对统计不可分的弧保留无向的特性。
应用推荐