非递归算法实现线索化二叉树，其中包含递归算法。

用途：用向量(稀疏存储)形式的Gauss-Seidel迭代解线性方程组Ax=b ％ 格式: x=spgs(A,b，x0,e,N),A为系数矩阵，b为右端向量，x返回解向量。 ％ x0为初值向量(默认原点)，e为精度(默认1e-4),设置迭代次数上限以防发散(默 ％ 认500)。 -purposes : with Vector (sparse storage) form of Gauss- Seidel iterative solution of linear equations Ax = b% Format : spgs x = (A, b, x0, e, N), A coefficient matrix, b subguadratic vector, returning x vector. X0% for initial vector (the default origin), e-precision (default 1e-4), iteration ceiling set to prevent divergence (mime identified 500%).

This the sorce code in Visual Basic 6 for the EMU8086 processor simulator. -This is the sorce code in Visual Basic 6 for the EMU8086 processor simulator.

图形编程 比较实用 我看了挺好的 和大家分享一下-Graphical programming more practical and I saw good U.S. share

关于MFC功能的源代码，包括控制条，文件操作，多视，打印技术等8部分内容的源代码。 此为压缩包2-Function on the MFC source code, including the control, the file operations, multi-visual, print technology, the 8 part of the contents of the source code. This is the compressed packet 2

用VC++7.0+DirectX7.0做的一个简单的RPG的游戏的小程序-a simple game for RPG game, which is based on VC++ 7.0 plus Direct C7.0 languages

一个用于入门的动态链接库的极好例子，当你把本例看完后，也就会在VC下封装动态链接库了，还有测试程序。-A dynamic link library for the entry-an excellent example, when you read this case even after the VC will be in the dynamic link library under the package, and there are test programs.

用JAVA做的聊天软件，有安装程序和源代码-do with Java chat software, installation procedures and source code

用c写的18b20驱动程序 功能：实现对DS18B20的读取 原理：单总线协议 注意：单总线协议对延时要求比较严格，此程序中采用的是11.0592M的晶振，如果使用其他的晶振请跟据DS18B20的资料修改延时参数-used to write the 18b20 driver function : to achieve DS18B20 read Principle : single-bus protocol attention : single-bus protocol to delay requirements more stringent, this procedure is used in the crystal 11.0592M if the use of other crystal please According to the information DS18B20 delay parameter changes

面向 Microsoft Word 2000 开发者的新内容 -Microsoft Word 2000 for the development of new content

城市链表的求解,通过城市查找坐标,通过坐标查找城市,以及两座城市之间的距离.-city Chain solution through urban search coordinates coordinates search through the city and the two cities in the distance.