银行定储模拟程序

这是我的数据结构课程设计源代码，请务必按提示输入数据，该程序的功能是用链表实现多项式的四则运算。-This is my data structure course design source code, you must follow the directions to input data, the program"s function is used to achieve Chain of four polynomial operations.

拖动开发代码，关于pb 的-Drag code on the pb

用C实现的基于O-tree的ic设计布图布线工具源代码,有相关文档-C realized based on O-tree-id wiring layout design tools source code, related documentation

神经网络中的K均值聚类算法II： 1.KMIn为输入数据文本，其中，第一个参数为所要聚类点个数，第二个参数为聚类点的维数,第三个参数为所要求聚类的个数 2.KM2OUT为经过K均值聚类算法II计算后得到的结果-Neural network in K-means clustering algorithm II: 1.KMIn input data for the text, of which the first parameter to be the number of clustering points, the second parameter is the dimension of clustering points, the third parameter for the clustering the number of requests for 2.KM2OUT after K-means clustering algorithm II calculation results

用贪心算法解决aflow 有调整时间的流水作业调度问题。-Greedy algorithm used to solve aflow have time to adjust the flowshop scheduling problem.

XMathLib是一个通用的3D图形数学库。 其中包含两个部分： XMathLib和XGeomLib。分别处理数学和几何运算。 数学部分包含向量、矩阵、四元数的运算。以及其它的运算。 几何部分包含Box Frustum AABB OBB Ray Line Line-Segment Plan Triangle等的运算。-XMathLib is a generic 3D graphics math. Which consists of two parts : XMathLib and XGeomLib. Separate processing mathematical and geometric computing. The math section includes vector, matrix, quaternion arithmetic. , And other arithmetic. Geometric part consists Box Frustum AABB OBB Ray Line Line-Segme nt Plan Triangle such arithmetic.

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

Delphi SQL数据库浏览器。可以连接数据库并对表中的数据进行查询修改。

想学习算法的朋友，可以看看拉格朗日算法参考参考-Want to learn algorithms Friend, you can look at the Lagrangian algorithm reference reference

战车问题 战车问题 战车问题 战车问题-The issue of the chariot chariot chariot issues issues issues chariot chariot chariot problem issues