5786748468

bo3-1.cpp 顺序栈（存储结构由c3-1.h定义）的基本操作（9个） algo3-6.cpp 表达式求值（输入、输出和中间结果均只能是0～9）(Bo3-1.cpp order of the stack (storage structure defined by the c3-1.h) basic operations (9) Algo3-6.cpp expression evaluation (input, output, and intermediate results are only 0 to 9))

说明：  VC++6.0实现语法高亮，我网上搜集的，觉得不错！！希望大家喜欢(yufagaoliang)

采用序列化对象CArchive读入原始数据构建Delaunay三角网的VC++代码。可以鼠标点击加新点进行构网，包括二维、三维。还可以进行设色、光照等。(Serializing objects using CArchive read the raw data to build Delaunay triangulation VC++ Code. Mouse clicks can add new points structure network, including the two-dimensional, three-dimensional. Can also be used for colors, light and so on.)

将窗口保存为JPG、PNG等图片格式，演示了CImage类在VC++中的应用，在VS2010下编译通过。(Save the dialog windows as JPG, PNG file, demonstrated the the CImage class in VC++, compiled by VS2010 under.)

说明：  sample of prrogramming by image ,textbox,button and other control in vb6

VC编程开发多线程端口扫描程序代码VC Programming code multi-threaded port scanner (VC Programming code multi-threaded port scanner )

全面模仿QQ，基本具备QQ功能，非常值得学习(Fully mimic QQ, with QQ basic functions that are worth learning)

说明：  Ｃ＃：windows下的文件相互复制拷贝(C#: windows-copy reproduction of documents under the)

本系统是本人采用Visual C++为开发工具，数据库采用的是最为普及的小型数据库管理系统Access，能实现宿舍管理中的添加信息、修改信息、删除信息、查询信息等必不可少的功能。(This system is I use Visual C++ development tools, database using the most popular small database management system Access, dormitory management to achieve the Add and modify information, delete information, query information and other essential functions.)

现有基于M apX 的最优路径分析, 对于TAB 格式数据拓扑信息的提取方法单一, 且未考虑导航特征。该文 结合道路导航特点, 提出了一套基于MapX 的最优路径分析解决方案。首先由T AB 格式数据提取拓扑信息, 为最 优路径分析奠定数据基础 然后针对导航的特征, 即最优路径分析的起点和终点可能出现在道路网外, 着重讨论了 对于Dijkstra 算法的拓展。(M apX the optimal path analysis, a single topology information for the TAB format data extraction methods, and did not consider the navigation features of. In this paper, combined with road navigation features, a set of optimal path analysis based on MapX solution. First extract topology information by T AB format data, to lay a data base analysis for the optimal path and navigation features, the start and end points of the optimal path analysis may appear in the road network, focused on the expansion of the Dijkstra algorithm.)