资源列表
linklist.tar
- 链表的增添，删除，遍历等基本操作，是单向链表，自己编写的-List of add, delete, traverse and other basic operations
sgu-499
- 题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 -Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers
shortest-path-algorithm-
- 有多个经度纬度已知的地点，用退火算法求最短路径。求一个从点1 出发，走遍所有中间点，到达点102 的一个最短路径。-There are several known longitude-latitude locations, the shortest path algorithm with annealing. Seeking a departure from the point 1, traveled all the intermediate points, to reach a 102-poi
lala
- 用遗传算法求解最短路径问题求解的遗传算法的参数设定如下： 种群大小：M = 50 最大代数：G = 1000 交叉率： = 1 c p ，交叉概率为1 能保证种群的充分进化。 变异率： = 0.1 m p ， 一般而言，变异发生的可能性较小-With a genetic algorithm to solve the shortest path problem of the genetic algorithm parameter settings are as follows: p
hgr
- 实现链表功能，检测一篇英文文章中的各字母总数-Implement a linked list function to detect an English article in the total number of letters
shujujiegou
- 介绍了数据结构的基本原理 已经在C环境下的编程 源码都能用-Introduces the basic principles of data structures have been programming in C source environment can be used
FastJob
- 快速作业排序，输入作业数后能够进行快速排序，代码在压缩包里面，希望对大家有帮助-Fast Scheduling, can enter the job after a few quick sort code in the archive which, we hope to help
data_struct-C
- 清华大学的数据结构C语言版本光盘，学习C的数据结构绝对好的资源！-Tsinghua University, the disc version of the C language data structures, learning C data structures is absolutely good resources!
pBEpAEpD7pD6pC6pE5
- 1. 两人在线对弈，界面显示棋盘和已下的棋子。棋盘为3X3网格，棋子落在格子中。用“o”和“X”表示两种棋子； 2. 某方的三个棋子连成一条线即赢；-1 Web-based submission system. 2 user registration function to register the author' s information. 3 authors can upload manuscr ipt. 4 The administrator can check all th
multy-calculator
- 通过输入多元多项式的元数以及多项式相关的系数、指数等信息，实现多元多项式的加减乘运算-Multivariate polynomial by entering the metadata and the associated polynomial coefficient, index and other information, to achieve multi-polynomial addition and subtraction multiplication
maze
- 主函数中有存储迷宫的二维数组，可以构造出迷宫的图形，程序通过算法找到一条从入口到出口的路径并输出。-The main function in the maze of two-dimensional storage array can be constructed out of the maze of graphics, the program through the algorithm to find a path from the entrance to the exit and output
CSharp---DFS-BFS
- 实现图的交互输入，可创建邻接表，还可进行深度优先遍历广度优先遍历，拓扑排序等-To achieve interactive map input, you can create adjacency table, but also for the breadth-first traversal depth-first traversal, topological sorting