包含两个文件，一个是.BGI文件，是图形化得驱动，没有它该C语言程序无法正常显示，另外一个是源程序，本程序功能为图形化的计算器...

学校景点分布图最佳路径选择，通过最短路径选择让游者能够自由选择最佳观赏路径-schools attractions distribution choose the best path through the shortest path chosen You can watch free to choose the best path

重写了微软提供SQLHelper(共用的数据库调用接口） 1把SqlHelper的connectionString做成一个全局量，统一设置数据库连接字符串 2增加了返回特定表名的DataSet的各接口。 可在项目的config文件设置数据库连接字符串 private static string connectionString = System.Configuration.ConfigurationSettings.AppSettings["ConnectionString"] 当然可以把数据库连接方法修改后直接用。-rewritten Microsoft SQLHelper (shared database Call Interface) a SqlHelper the connectionString caused an overall volume, uniform database connections increased by two strings to the specific name of the table in the DataSet interface. In the config files set database connection string private static string connectionString = System.Configuration.ConfigurationSettings.AppSettings [ "ConnectionString"] lt; !-- Application specific settings-- gt; Lt; AppSettingsgt; Lt; Add key

java 数据结构与算法译作者： [美]Clifford A.Shaffer著 张铭 刘晓丹译 　　包含范围：Java算法 　　尽管基本上Java图书都是讲Java本身的特性。因为Java的体系太庞大了，而用Java来实现的数据结构与算法，这本书也是唯一一本，所以尽管这本不是那么的好但还是做以推荐 -java construction of data and algorithm translated work: [ Is beautiful ] Clifford A.Shaffer inscription Liu Xiao Dan to translate Contains the scope: Java algorithm Although the basically Java books all speak the Java itself characteristic. Because of Java system too huge, but construction of data and algorithm which realizes with Java, this book also is only 11, therefore although this originally is not such is good but or does recommends

用C++写的链表操作，可以作为一个简易的文本编辑器-list

这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.

用链表建立堆栈的简单代码，没有做很多的排错处理，只是了解了解堆栈的实现方式

数据结构实现一个队列的操作，有插入删除等功能-queue

树的数据结构源代码-tree data structure source code

用c编写的数据内部排序方法,可在窗口中选择多种排序方法,如快排,冒泡,折半插入等,还可以选择排序数据的个数,初态,控制等.-using data prepared by the internal order, the window can choose a variety of sequencing methods, such as fast Pai, bubbling half insert, can also choose the number of original data, the initial state, and control.

根据广义表创建一棵二叉树，然后中序线索化，再遍历。-Create a table based on generalized binary tree, and then in the sequence of clues, and then traverse.