it con do it! good thank you

编程者论坛2003年帖子合订本，需要的可以看看滋养一下，方便多了。-Programming Forum posts 2003 booklet, need nourishment you can look at, much more convenient.

Object Pascal参考.chm-Object Pascal reference. Chm

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小: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.

模板编程--完全手册，这类书中比较全的学习资料，自己感觉很不错。不知道有没有重复-Template Programming- completely manual, this type of book-wide comparison of learning materials that they feel is pretty good. Do not know if there was any duplication of

雷达教学的经典书籍《MATLAB Simulations for Radar Systems Design》的随书光盘-radar teaching classic books "MATLAB Simulations for Radar S ystems Design "of the CD with the book

GPS星历内插资料,分别采用拉格朗日,牛顿法,是不错的资料!-GPS ephemeris data interpolation, using Lagrange, Newton"s Law, which is good information!

- US Navy - Electronics Technician - 9 - Electro-Optics-- US Navy- Electronics Technician- 9- Electro-Optics

目前最好的模式识别与机器学习的教科书，国内还没引进，只有英文高清版-Currently the best pattern recognition and machine learning textbooks, yet the introduction of domestic, high-definition version in English only

不错书对C++/C程序员很有用的大家不要错过.-good book on C/C programmers very useful you should not miss.

深度优先搜寻的模板，深搜可以解决很多图的问题，可以遍历图中的任意位置，从而解决问题-Depth-first search template, deep search problems can be solved a lot of plans, you can traverse the graph of an arbitrary position to solve the problem