This paper presents an algorithm for solving a complete monotonic chain set in the planar straight line graph g.
本文提出求平面直线图完全单调链集的一种算法。
A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
A complete recursive algorithm for minimal reduction under graph view is designed.
本文提出图表示下的知识约简，给出图表示下求最小约简的完备递归算法。
A complete recursive algorithm for minimal reduction under graph view is designed.
本文提出图表示下的知识约简，给出图表示下求最小约简的完备递归算法。
应用推荐