资源列表
Graph
- 依靠链表结构实现的图像(Graph)类抽象数据结构-graph ADT implemented by an Adjacency List structure
PatternMatching
- implement a number of pattern-matching algorithms and to carry out an analysis of their operation
RoutingSystem
- The task in this assignment is to implement an airline routing system. Your system should be able to read in a ight network as a graph from a le, where airports are represented as vertices and ights between airports are represented as ed
Sort
- The running time of quicksort can be improved in practice by taking advantage of the fast running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return wi
shortest-path
- 经典最短路径算法，内含多个工程项目，可下载-The classic shortest path algorithm, contain a number of projects, can be downloaded
Maze
- 数据结构的迷宫求解，用C++编程，在VC编译通过-Data structure to solve the maze, using C++ programming, compiler in VC through
Pack
- 动态规划问题中经典的背包问题及其变体的讲解，共分9节，深入浅出。-Dynamic programming problem in the classical knapsack problem and its variants to explain, consists of nine, in layman' s language.
stack
- 链表排序：首先生成一个多项式，然后根据用户需求得到多项式的任何指数-Sort list: First of all, to generate a polynomial, and then based on user needs are any index polynomial
kmp
- KMP字符串匹配算法C语言实现 精确度高-KMP string matching algorithm C language to achieve high accuracy
bm
- BM可以说是继KMP算法之后更加 优秀的字符串匹配算了，BM 是大师Boyer-Moore的算法杰作， 所以称BM算法， 相比KMP算法效率提高了不少， -BM can be said that after following the KMP algorithm for string matching better forget, BM is the master of the Boyer-Moore algorithm masterpiece, so that BM algorit
beibao
- 数据结构算法背包问题解法之递归解法，C语言实现 -Data structure algorithm of knapsack problem Recursive Solution Method, C language
qishi
- 图算法之骑士遍历问题，骑士遍历问题，或者象棋中马的遍历问题-Knight traversal, or chess problem in ergodic horse