用VB6.0实现的最短路径分析，采用了优化的方法（搜索方向一致性）...

操作系统中的文件是通过文件目录项来管理的，为了管理和查找的方便，按层次把文件目录项组织起来，同一层上的目录构成该层上的目录，第一层为根目录，一下为各层子目录。 假设以一串字符代表一个文件，每个字符表示一个记录。 在建立上述目录结构的基础上，建立相应的管理系统并要求完成以下各项操作： 1． 一次建立各个文件 2． 查访两个用户的所有文件 3． 查访用户sun 是否有文件AB 4． 删除用户sun的文件AC,然后在分别查访两个用户的全部文件，检查是否已经删除文件AC 5． 撤销用户sun,并检查是否被删除 6． 删除用户sun的全部文件，然后在撤销sun用户，在查访用户sun, 检查其是否已被撤销。 在建立一个新用户及新用户的两个文件，然后查该两个用户的所有文件-operating system, the paper is to document catalog items to the management, in order to manage and facilitate the search, according to the document level directory entries organizations, the same floor on which constitute the directory contents on the floor, the first layer of the root directory to look for levels of subdirectories. Assuming that the representative of a string of characters, each character expressed a record. In establishing the directory structure on the basis of the establishment of a corresponding system of management and asked to accomplish the following : 1. Once established two separate files. Visits to the two users of all three docum

实验说明   实验所用英文文本为 /HaffmanfT 下的a.txt文件，原文为： South Korea’s top court ruled on Thursday that Japan’s Mitsubishi Heavy Industries Ltd must compensate 28 South Koreans for their forced labor during World War Two, a ruling that drew an immediate rebuke from Tokyo. The decision echoed the Supreme Court’s landmark verdict last month that ruled in favor of South Koreans seeking compensation from Japan’s Nippon Steel & Sumitomo Metal Corp. for their wartime forced labor. The court upheld a 2013 appeals court decision that Mitsubishi must pay 80 million won ($71,000) to each of the 23 plaintiffs in compensation. In a separate

实现了波兰式的求解，对大数计算使用，可以到100位数的运算-realization of the Polish-solving, the use of large numbers calculation, the median of 100 Operators

旅客航班预订系统，可以实现预订、查询、退票等功能

数据结构中线性表的应用，约瑟夫环算法。便于数据结构的学习。-Linear data structure in the application form, Joseph Ring algorithm. Data structure to facilitate learning

将数据库输出到一个文本文件中-database output to a text file

我自己编写的一个C++ kruskal最小生成树程序，希望可以对初学者有所帮助，错误难以避免，希望大家谅解 -I have written a C++ Kruskal minimum spanning tree procedure, hoping to be helpful for beginners, it is difficult to avoid errors, I hope everyone understanding

《数据库系统实现》前四章，数据库实现的经典书，介绍了很多原理性的东西。-" Database system implementation," the first four chapters, the database to achieve a classic book describes the principles of a lot of things.

魔方阵完整算法（内含详细解释） 包括奇数和偶数 在VC6.0下运行-Magic matrix integrity algorithm (containing detailed explanation), including odd and even run in VC6.0

使用单独的一个mdb文件，分类保存图片、文档资料，并自带图片浏览器。支持与操作系统之间的文件拖放来导入、保存文档图片。 程序对ListView、TreeView控件的应用，在Access数据库中使用二进制保存文件等的应用，可供大家参考。-It s a Mdb Code file.It s a good sample for ListView and Treeview.