资源列表
下拉式菜单（一级子菜单）(tc2)
- vc6.0 ?实现的用户界面-vc6.0 achieve user interface
PC机界面开发
- PC机界面开发,用C语源开发的代码,有兴趣的自己下载下来看看吧-PC interface development with the development of C language source code, are interested in their downloads to see it
小型的窗口字处理软件的C 语言源程序
- 小型的窗口字处理软件的C 语言源程序 ,可能对有些人有帮助吧-small window of word processing software in C language source code that is likely to help some people it
GenerateMethod
- 一个很好用的方法生成器，基于MSSQL，可以通过自动得到数据库、表、存储过程的列表，并且可以通过多种方式得到表的类，可以到http://www.ht-golden.net/GenerateMethod/download.asp下载编译过和的程序-a good method of generator, based on MSSQL, can be automatically database, table, and stored the list, and can be a variety of
Basic_FLTK_File_Chooser
- 基于vc6环境下开发，实现了打开文件操作，利用了fltk图形开发包-based vc6 environment in development and operation of open files using a graphical development kit fltk
Basic_FLTK_Help
- 基于vc6环境下，利用fltk开发包实现了程序帮助文档的调用-vc6 based environment, using fltk development kit for the help documentation procedures call
Basic_FLTK_Menu_Fixed
- 基于vc6环境下，显示了如何加入系统菜单示例，利用了fltk图形开发包-vc6 based environment, demonstrating how to join the system menu example, the use of a graphical development kit fltk
Button_Callback
- 基于vc6环境开发，示例说明了如何使用两个按钮空间实现不同的回调函数的功能-vc6-based development environment, examples of how to use two buttons space to achieve different callback function
地图染色
- 用VC运行环境编写的地图染色问题 运用了4色染色定理,内容详细,有原代码分析-VC environment for the operation of the maps were prepared using four issues staining theorem, detailed, the original code analysis
遍历二叉树的4个非递归算法
- 二叉树的4个非递归算法,中序先序后序和层次遍历,算法都有注释而且很详细,适合数据结构学习者使用-binary tree four non - recursive algorithm, the first sequence after sequence and the sequence level traversal algorithm Notes but have very detailed data structure suitable for use Learners
树的高度和叶子结点数
- 先是建立一个树,然后对树进行转换变成二叉树,求出树的高度和叶子节点,此程序对于数据结构学习者很有帮助-First, the establishment of a tree, the tree then converted into a binary tree, the tree calculated the height and leaf nodes, the procedure for data structure learners helpful
普里姆算法
- 利用prim算法来计算最小生成树,对于数据结构学习者有很大帮助,利用邻接矩阵来存储图-Prim algorithm used to calculate the minimum spanning tree, the data structure for the learner is very helpful to use the adjacency matrix storage plan