用Dijkstra算法求解最优切割方式的模型

The Model of Solving the Optimum Cut Way with Dijkstra Algorithm

从待加工的长方体中加工出一个已知尺寸、位置预定的长方体,需寻找一种最优切割方式.利用图论中的Dijkstra算法可得到上述问题的数学模型和求解方法,同时对一组具体数据给出了最优解并进行了讨论.

Processing out a known size from the cuboid waiting to be processed,the cuboid booked in position,need to look for one to the optimum cut way.Utilize the Dijkstra algorithms of graph theory can receive the mathematics model of above-mentioned problems and ask the method of solving,appeared to a group of concrete data so optimum as to solve and discussedly at the same time .