用C++开发餐馆导航系统

BDijkstra算法的java实现。使用工具是eclipse，java1.4以上-BDijkstra algorithm to achieve the java. Eclipse is the use of tools, more java1.4

将内存中的一段数据拷贝到另外一段内存中，要考虑其中的内存覆盖问题。-A section of the memory to copy data to another section of memory, it is necessary to take into account the memory coverage problems.

对系统随机生成的一组数据进行排序，查找，统计不同排序方法需要的比较次数和交换次数以及不同排序需要的时间，还有要记录查找时间-The system randomly generates a set of data to sort, search, statistical comparison of the different sorting methods require the number and frequency of exchange, as well as the time required for the different sort, as well as to find time to record

ORACLE数据库的并集查询-ORACLE database inquiries and Set

数据结构与算法分析C++描述 期末评分的东东 自己写的，有用吧・-Analysis of data structures and algorithms described in C++ to write their own final score Dongdong, useful bar

编写算法，在二叉排序树上找出任意两个不同结点的最近公共祖先-Write algorithm, binary sort tree to find any two different nodes of the nearest common ancestor

C 语言开发HNT格式数据库系统 -boosted the development of C language format database system

经典的八皇后问题，结合MFC界面编程，能够清晰看到皇后的排列位置。-eight Queen"s classic, combining MFC programming interface, can see clearly what the position with the Queen.

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing