▍1. jgctgu
流水线车间的零件加工排序问题，以达到最优的加工顺序，使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)
更多选项
▍2. mifeng
c语言平时作业练习，包括输入输出，数组，链表等 c语言平时作业练习，包括输入输出，数组，链表等(output mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifeng)
▍3. C-18-typical-classic-program
C语言18个经典程序，算法。可以用到很多场合(18 typical programs. Could use in many situations)
▍4. 3.4.6
单链表中的数据元素含有三种字符（字母、数字、其他字符），算法实现构造三个循环链表，是每个循环链表中只含有同一类字符，且利用原表中的结点空间作为这三个表的结点空间。(Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle list contains only the same type of character, and make use of the primary node space in a table as a node of the three table space.)
▍5. sf_2014320164457
数据结构中的许多东西,包括头文件、例题、习题等等(Data structure many things, including the header files, examples, exercises, etc.)
▍6. Binary-search-algorithm
在数据结构中，用C语言编程实现二分法查找算法(In the data structure, using C language programming binary search algorithm)
▍7. threads
Nachos操作系统 修改线程的数据结构增加线程ID和用户ID(Add ThreadId and UserID for Nachos)
▍8. string
实现字符串基本上所有的功能，其中有KMP算法，有各种字符串的判别以及提取(it is really useful and wordenful)
▍9. matrixTran
稀疏矩阵的快速转置方法，简单的实现方法，适合初学者(Fast transpose sparse matrix methods, a simple method which is suitable for beginners)
▍10. dynamic-programming
用动态规划法求两个字符串 A="xzyzzyx"和 B =”zxyyzxz“的最长公共子序列(For two strings A dynamic programming method = " xzyzzyx" and B = " zxyyzxz" the longest common subsequence)
▍11. dynamic-programming
用动态规划法求两个字符串 A="xzyzzyx"和 B =”zxyyzxz“的最长公共子序列(For two strings A dynamic programming method = " xzyzzyx" and B = " zxyyzxz" the longest common subsequence)
▍12. 0-1bag
经典的0-1背包问题，程序可以自动输入并且有注释(Classical 0-1 knapsack problem, the program can automatically entered and annotated)
▍13. 0-1bag
经典的0-1背包问题，程序可以自动输入并且有注释(Classical 0-1 knapsack problem, the program can automatically entered and annotated)
▍14. Huffman
数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
▍15. Huffman
数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
▍16. Maze-code
以一个m×n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。首先用二维数组存储迷宫数据，迷宫数据由用户输入。一个以链表作存储结构的栈类型，然后编写一个求解迷宫的递归或非递归程序。求得的通路以三元组（i，j，d）形式输出，其中：（i，j）指示迷宫中的一个坐标，d表示走到下一坐标的方向（东、南、西、北四个方向所用代表数字，自行定义） (With an m × n the long square maze, 0 and 1, respectively maze of pathways and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or come to the conclusion there is no path. First of a two-dimensional array to store the data maze, maze data input by the user. A linked list storage structure for stack type, and then write a recursive or non-recursive solving the maze procedure. Obtained access to triples (i, j, d) in the form of output, of which: (i, j) indicates the maze of a coordinate, d represents the coordinates walked next direction (east, south, west, north four directions used on behalf of a digital, self-defined))
▍17. Maze-code
以一个m×n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。首先用二维数组存储迷宫数据，迷宫数据由用户输入。一个以链表作存储结构的栈类型，然后编写一个求解迷宫的递归或非递归程序。求得的通路以三元组（i，j，d）形式输出，其中：（i，j）指示迷宫中的一个坐标，d表示走到下一坐标的方向（东、南、西、北四个方向所用代表数字，自行定义） (With an m × n the long square maze, 0 and 1, respectively maze of pathways and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or come to the conclusion there is no path. First of a two-dimensional array to store the data maze, maze data input by the user. A linked list storage structure for stack type, and then write a recursive or non-recursive solving the maze procedure. Obtained access to triples (i, j, d) in the form of output, of which: (i, j) indicates the maze of a coordinate, d represents the coordinates walked next direction (east, south, west, north four directions used on behalf of a digital, self-defined))
▍20. nearest-point-two-dimensional-space
本代码实现了算法导论中二维空间下的最近点对查找的算法。(Find the nearest point on the two-dimensional space under)
本站资源：696522 个
本站会员：104044 个
总计下载：489498 次
今日上传：0 个
- 优秀论文及配套源码 SVM Short-term-Load-Forecasting
- 综合能源优化含储能
- 用遗传算法改进粒子群GA-PSO算法
- 通过粒子群能够很好的解决优化问题 pso
- 天牛群算法 BSO
- 混沌粒子群优化算法
- 2019年中国研究生数学建模竞赛E题
- 智能算法的Matlab仿真程序及教程
- 《MATLAB R2016a神经网络设计与应用28个案例分析》随书代码
- BAS BP论文及代码
- denoising
- Airy 基模高斯光束
- EMS Microgrid
- 2012年全国大学生数学建模竞赛题目--葡萄酒的评价Wines-Evaluation
- GA-bp
- 本人调试的大作业 源程序模型+论文 intelligent_control_modle
- LSTM的例子、单向LSTM、双向LSTM、多层LSTM
- 遗传算法优化BP网络案例
- 通过yalmip平台调用cplex求解器 microgrid Cplex
- 基于lstm算法在MATLAB对短期风速进行预测 LSTM-regression-master
