利用集合的思想对顶点着色算法进行研究,得到一种简洁的顶点着色算法。
Using the thought of mathematical set, this paper is intended to carry out a study into the algorithms for vertex coloration. Therefore, a simple algorithm can be found out.
首先对顶点进行分组,采用逐次改进法求出每一组的近似最佳售货员回路。
At first, the groups division is made on the apex, then applying a successive improvement method to find out an approximate optimum return trip for saleclerks in every individual group.
这意味着在基于位移的设计中,还应该以R取值为依据,对顶点目标位移的确定方法进行修正。
It shows that, in displacement-based seismic design, we also should improve the target roof displacement computing method based on the value of r.
应用推荐