资源列表
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell commodities, the known distance
95302948zuigansuanfa
- 比较好的算法，其中有自己写的很好用的链表，大家可以下载-better algorithm, which has its own very well written with the List, we can look at the download
sort_method
- 各种排序算法，包括快速排序、插入排序、选择排序、SHELL排序-various sorting algorithms, including rapid sorting, insertion sort, select, in order of ranking SHELL
hafum
- 这是一个用C语言编写的哈夫曼编/译码器程序，与严蔚敏版数据结构习题的5.2相对应啊-This is a C language prepared by the Huffman encoder / decoder procedures, and Yan Wei-min data structure Exercise version 5.2 should be relatively ah
duoxiangshiyunsuanqi
- 有漂亮的用户界面,用链表实现多项式的各种运算,推荐刚学数据结构链表的人下载.-a beautiful user interface, List polynomial used in a variety of computing, has recommended data structure Chain downloading from the Internet.
ostang
- 这是我上个学期操作系统的课程设计，做了一个多级文件系统，用文件模拟磁盘，基于i节点结构，功能超强，希望对大家有用。-This is my last semester of courses operating system design and a multi-level file system, disk using simulated document, based on i node structure, function superpower, we hope that the right
permtang
- 这是一个生成全排列的程序,采用最小变化算法,相邻两个序列之间只有两个数的次序不同,每交换两个数,便形成一个新的序列,速度非常快.-This is a whole generation with a procedure using the smallest change algorithm sequence between two adjacent only two of several different order every two exchanged a few, it will lead
combtang
- 这是一个生成组合序列的程序,而且是非递归的,代码非常精简,速度很快,序列是字典序的.-This is a combination of sequence generation process, but also non - recursive, code very concise, very fast, is the sequence of lexicographic.
huffman_cdoe
- 多个Huffman编码、解码器的程序，对数据结构的学习者很有用。-over Huffman encoding, decoding device procedures, data structures useful to learners.
数值算法－QuadraticPenitentiary
- 我自己用VC++开发的数值算法程序——二次罚函数罚，对于处理带约束的问题效果很好-my own use VC numerical algorithm development process -- second penalty function fines, and dealing with the problem of constrained good results
ayangmovie
- 有关遗传算法的例子，可以解决诸如数学中函数近似最大值，最短路径的问题.vb开发的,很好的 .-example, can be resolved, such as mathematics function approximate maximum shortest path problem. Vb development, very good.
BFSandDFS
- 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservatio