资源列表
huffman
- 从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树并将它存于文件hfmTree中。将已在内存中的哈夫曼树以直观的方式（比如树）显示在终端上； -Read from the terminal character set size n, and n-n-weight character and to build the Huffman tree and store it in the file hfmTree. Will have the Huffman tree in memory
dataSruct
- 使用C++实现单链表,非常适合数据结构的初学者。-The list using c++.
algorithm
- 一些经典算法例子，非常适合初学者。 一些经典算法例子，非常适合初学者。-The algorithm of the compute.
GraphA
- 数据结构里关于有向图传递闭包算法求出两点间最短距离的部分资料-Data structure diagram on a transitive closure algorithm to find the shortest distance between two points some of the information
Floyd_Warshall
- 使用Floyd_Warshall算法球出任意两点的最短距离。-Floyd_Warshall algorithm using the ball out of the shortest distance between any two points.
BFSApp
- 利用BFSApple算法求出两点之间的最短距离。-BFSApple algorithm using the shortest distance between two points is calculated.
DFSApp
- 利用DFSApple算法求出两点之间的最短距离。-DFSApple algorithm using the shortest distance between two points is calculated.
MSTWApp
- 利用MSTWApple算法求出两点之间的最短距离。-MSTWApple algorithm using the shortest distance between two points is calculated.
TopoApp
- 利用TOPOApple算法求出两点之间的最短距离。-TOPOApple algorithm using the shortest distance between two points is calculated.
KMP
- KMP字符串模式匹配通俗点说就是一种在一个字符串中定位另一个串的高效算法。简单匹配算法的时间复杂度为O(m*n) KMP匹配算法。可以证明它的时间复杂度为O(m+n).-This file contains a summary of what you will find in each of the files that make up your KMP application.
acm
- acm 的几道题pku1611pku1182boj1456ACM入门及基本数据结构-acm The few, pku1611pku1182boj1456ACM entry and basic data structures
AlgorithmsandDataStructure
- 算法与数据结构（C 版）[漆涛][程序源代码] AAtree AvlTree Bstree Deap ds_codesAndProjectsV1(20090530) EightQueen FibonacciHeap Fmsets graph HeapSort IndirectSort InsertSort MergeSort MaxHeapAndMinHeapMatrix List Stack StringTreap Vector-Algorithms and Data Structures