大量领域应用了计算几何的问题,包括欧几里得巡回售货员问题,最小生成树问题,隐藏线问题和线性规划问题-A large number of field applications of computational geometry problems, including Euclid roving salesman problem, minimum spanning tree problem, hidden line problem and linear programming problems, a

对图的深度，广度遍历，关键路径算法，最短路径算法实现，求生成树的深度及叶子结点数-Depth, breadth traversal, critical path algorithm, the shortest path algorithm, find the depth of the spanning tree and leaf nodes

分形树的生成算法 实现分形树的绘制 有参数输入窗口，通过该窗口输入生成树的各个参数：颜色，大小，旋转角度等等 -Drawing algorithm to generate fractal tree fractal tree parameters are input window, enter the parameters of the spanning tree through the window: color, size, rotation, etc.