FMS3 开发者手册,是fms开发入门比较不错的书籍,里面有服务端对象的说明和客户代码的详细解说...

OMNeT++进行WSNs仿真,介绍在Windows平台下OMNeT的安装以及进行WSNs仿真的方法。-OMNeT++ for WSNs simulation, introduced in the Windows platform as well as the installation of OMNeT simulation WSNs.

轻松掌握用visualc++6对数据库编程-easily grasp with visualc six pairs of Database Programming

数字图像处理源码，很详细的介绍了VC在图像处理上的应用，不要错过好东西啊。-Digital image processing source code, it is a detailed introduction of the VC in image processing applications, do not miss something good ah.

C#150例，全部都是经典，值得学习和体会，希望对大家有所帮助-C# 150 cases, all of them are classics, worthy of study and experience, I hope all of you to help ... ...

C++ Tutorial 这本书的随书源码-C Tutorial this book with the book source

vVC显示图片 VC显示图片 VC显示图片 -showed pictures showed pictures VC VC showed pictures s howed VC VC Photo Illustration Photo shows films VC VC VC showed pictures showed pictures showed pictures VC

VC++ 技术内幕 (第五版) chm格式-VC++ Technology Insider (Fifth Edition) chm format

matlab绘制3D Contour,需要的同志可以借鉴-matlab draw 3D Contour, the need for comrades can learn from

ASPNETDatabaseProgrammingW

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.