资源列表
knighterrent
- 骑士漫游，最常见的递规问题，大家看看吧。呵呵，初次，请多见谅-Knight roaming, the most common delivery regulatory issues, we look at it. Oh, first, please excuse me
beseelnetwon
- 本人自编的共轭梯度法。为c源码，已在TC下运行通过-I wrote the conjugate gradient method. C-source has been running through TC
shunxuList
- 包括顺序链表的查找，删除，插入，计数，和删除重复元素等操作，是我的数据结构家庭作业，大家可以参考一下，欢迎多提意见！-including sequence Chain search, delete, insert, calculators, and the deletion of repeat elements and other operations, I is the data structure of a family operation, we can take a look, plea
mylist654
- 包括链表的遍历，插入，删除，排序，回文判断，折半查找等操作，适合数据结构的初学者，希望对大家有帮助-including Chain traversal, insertion, deletion, sorting, palindrome judgment, binary search, etc, data structure suitable for beginners, we hope to help
mystack1008
- 包括栈的push\\pop,计数，查找等操作，简单易行，适合数据结构的初学者-including Stack push \\ pop, calculators, searching operation is simple, the data structure suitable for beginners
xunkexitongdatastructure
- 这是一个利用数据结构开发的学生选棵系统,是基于数据结构!-This is a data structure used in the development of students trees election system is based on the data structures!
dijkstraautomatique
- dijkstra算法，windows和linux下编译通过，可以从文件读取数据，也可以手动输入边数及点数，自动生成边长。-dijkstra algorithm, windows and linux under compile, can read data from the paper, can also manually input edges and points, automatic generation length.
Bellman_Fordautomatique
- bellmanford算法，windows和linux下编译通过，可以从文件读取数据，也可以手动输入边数及点数，自动生成边长。-bellmanford algorithm, windows and linux under compile, can read data from the paper, can also manually input edges and points, automatic generation length.
CountBTLeaf
- CountBTLeaf.c--本程序用于求二叉树的叶子个数。 ---Author:zhg 2006.12 E-mail:wudazhg@163.com-CountBTLeaf.c - - The procedures for seeking the number of binary tree leaves. --- Author : zhg 2006.12 E-mail : wudazhg@163.com
traveljinshi
- 旅行售货员问题的近似算法 数据结构 算法 NP完全问题-traveling salesman problem approximation algorithm data structure algorithms NP-complete problem
BFS11223
- 该程序实现了 无向图的建立和广度优先搜索及输出-the program no plans to the establishment and BFS and output
Memory2(new)
- 模拟64M的内存的动态管理,包括分配.回收.操作系统实验课程设计题目-64M simulation of the dynamic memory management, including the allocation. Recovery. OS experimental curriculum design topics