资源列表
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
java网络编程实例
- Java各种网络代码,方便了java开发者,加快了程序员的开发进程。 -Java code various networks, and facilitates the java developers, programmers accelerate the development process.
国际大学生程序设计竞赛题解
- 要想看看自己的编程水平有多高。除了开发项目和做出象样子的软件以外,还有一个很好的办法就是参加比赛.而国际大学生程序设计竞赛题解,为你提供了检验自己的一个很好的挑战。里面不仅有大量的例题,还有各种算法的分析和与实例的结合。是提高英文和编程能力的绝对好书了-To look at our own programming level is very high. In addition to development projects and to make the software look like t
C语言实现的皇后问题
- n皇后问题,可以显示所有的合适路径,典型的回溯算法-n Queen's, will show you all the appropriate path, the typical backtracking algorithm
SortSource
- 用VC+ASM做的内排序比较软件,共比较6种排序,最大特色是通过汇编计算排序运行时间,详细看readme.txt-VC ASM done within sequencing software comparison, a total of six more species, in order of greatest characteristics is calculated by compiling Sort running time, a detailed look at readme.txt
0801
- 功能:构造图,并进行图的深度优先遍历(邻接表存储结构),图的广度优先遍历,内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of the source code
数据库课程设计题(成绩管理)
- --- - -