LR(0)

数据结构c源代码实现，大概有100个左右，基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

说明：  数据结构：Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)

用邻接表表示的数据结构，及DIJKSTRA算法实现的最短路径程序(adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures)

简单的一个链栈.即用链表实现的一个栈。可以做简单的插入、删除、查找等操作(this is a simple C++ program )

八皇后算法，用的是最简单的穷举法，在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)

一个KDtree的程序，包含建树过程和消耗的时间。(A KDtree procedures, including the contribution to the process and time consuming.)

C常用算法程序集，一些C语言的基本算法在里面都可以找到。(this is a very good book about c language,you will find it is very useful in your work.)

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

图中计算最短路径，必须覆盖所有的节点，效率很高(to compute the shortest path in the graph)