Dijkstra algorithm, has been established for finding the shortest path map is a...

免费的Delphi控件，可以替代BDE，直接访问.dbf数据库-Free Delphi ActiveX component,replace BDE and direct access .dbf database

本程序是一个宾馆程控电话系统，调试成功。对于初学vc的mfc变成有用，主要是与数据库的调用方面。-This procedure is a hotel program-controlled telephone system, debugging success. Mfc in vc for the beginner into a useful, mainly with regard to the database call.

医药销售管理系统 1）基本要求： （1）分析各系统的需求； （2）选用DBMS和设计工具； （3）提出系统的设计方案； （4）对所设计的数据库系统进行调试。 -Pharmaceutical Sales Management System 1) Basic requirements: (1) to analyze the needs of each system (2) selection of DBMS and design tools (3) for the system design (4) database system designed for debugging.

数据结构中实现图的关键路径的算法，是在TC中运行的。-data structure to achieve the critical path map algorithm is run in the TC.

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

超市选址，用数据结构，求最小生成树问题。自设计算法为超市寻找一个最短路径。-Supermarket site, the data structure, and minimum spanning tree problem. Since the design of algorithms for the supermarket to find a shortest path.

数制转换，将二进制数转换为十进制数。数制转换-shuzhizhuanhuan

算法艺术与信息学竞赛.pdf,仅供大家参考。-Algorithm art and informatics competitions. Pdf, for your reference.

数据结构词典（英文）-data structure Dictionary (English)

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① 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