搜索资源列表
dijkstra
- Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the starting
FlashThief
- U盘小偷,自动隐藏,优化配置,当有u盘插入先将word,excel拷贝到系统目录-U disk thief, auto hide, optimal allocation, when u drive into first word, excel copy to the system directory
Delphi
- 机械优化设计第四版的课后习题的答案源程序-Optimal Design of Mechanical Exercises after the fourth edition of the source of the answer
Delphi_CuttingStockSource
- This program will try to find optimal solutions for what is commonly known as the 1-dimensional Cutting Stock Problem, The Cutting Stock problem requires that we find the best (cheapest) way to cut one-dimensional stock pieces (pipe, dimensional lumb
Logistics
- The program for the management of logistics. It allows you to optimally distribute the load on the machine and create the optimal route of transportation.