资源列表
HUFFMAN
- 哈夫曼树相关程序，利用哈夫曼（最优树）的原理，实现编码译码的实例之一。本程序包括，按给定字母频率生成编码表，编码、译码过程。-Huffman tree associated procedures, the use of Huffman (optimal tree) in principle, to achieve one instance of coding and decoding. The program includes, at a given frequency to generate
tongxunlu
- 用数据结构中的双向链表作数据结构,结合C语言基本知识。-With two-way linked list data structure for the data structure, combined with the basic knowledge of C language.
Calgorithm
- C语言常用算法源代码，非常实用，包括各种常用的算法。
MazeAlgorithm
- 迷宫算法从入口到出口，传统的算法，堆栈和数组实现。- IEEE MicroMouse Maze Algorithm Research and Implementation of The Algorithm
ljl
- 可以实现对地质大学景点的旅游景点咨询系统。-it is very easy,if you have used this you can outlook our school.
datastructure
- 基于c的数据结构,提供了重要算法的实现源代码，很实用的-data structure based on c，it is very valueable,you can learn much from this resourse
1
- data structures教案，第一章数组与广义表-Teaching data structures, the first chapter with a broad array of table
BFS
- 人工智能中的宽度优先搜索算法，保证原创，开源共享-Artificial Intelligence in the breadth-first search algorithm to ensure the original, open-source sharing
cut-the-minimum-cut-problem
- cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E)
pharacter_delete
- 可是输出N条相同边的最短路径程序！！！！！！！1()
juzhengsuanfa
- C++课程设计 矩阵算法 一种比较简单的方法 C语言初学者制作-C++ program design matrix algorithms a relatively simple way to produce C language for beginners
kmp
- 串匹配问题。在主串中找出与模式串匹配的字符开始位置即下标。-String matching problem. In the main string and pattern matching to find the character position that subscr ipt.