摘要
本文分析了Wei算法存在的问题,给出了一个复完全有向图顶点排序算法,使不满足传递性的群体决策成为可能,具有现实意义。
We analysis the problem with Wei algorithm in this paper and propose an algorithm to sort the vertexes of complete oriented multigraph. It makes the group decision which is not satisfactory for transitivity become possible and have practical significance.
出处
《青岛大学学报（自然科学版）》
CAS
2001年第4期41-44,共4页
Journal of Qingdao University(Natural Science Edition)
