图的平面性判定算法是相当复杂的。
Planarity testing algorithm of graphs is a quite complex process.
本文给出了同时完成图的平面性判定，平面化，以及平面嵌入的一个算法。同时给出了这一算法的机器化结果。
In this paper, an algorithm with its mechanicalization is given, by which one can accomplish the following tasks simultaneously: planarity testing, making and embedding.
本文给出了同时完成图的平面性判定，平面化，以及平面嵌入的一个算法。同时给出了这一算法的机器化结果。
In this paper, an algorithm with its mechanicalization is given, by which one can accomplish the following tasks simultaneously: planarity testing, making and embedding.
应用推荐