SHU

PKU ONLINEJUDGE 2371

八皇后问题，用vc编写了一个可以解决八皇后问题的程序，实现了递归调用。(The eight queens problem, using vc write a means of solving the eight queens problem program to achieve the recursive calls.)

包含了数据结构实现堆栈的方法。 主要有链表实现和数组实现以及堆栈的应用。(This pakcet inclues the programs to implement the stack with chain and array and it s application.)

1.建立两个有序得链表（带表头，用头插法）； //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除，使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)

自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)

本例主要设计查找的有关算法，例如有序表的查找和顺序标的查找，顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)

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

这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

1>实现可以随意浏览任一景点的介绍。（功能一） 2>可以给出任意两个景点的最短距离及其路线。（功能二） 3>可以查看任一景点热度，并可以对对所有景点热度（访问次数）进行排序。（功能三） 4>每个景点相关内容从文件读取，实现对文件操作的练习。 (1> implementations can feel free to browse introduce 任一景 points. (Function a) 2> You can give the shortest distance and route between any two attractions. (Function b) 3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c) 4> each spot related content file reading, to achieve the file operations exercises.)