一个关于图书管理的VFP软件，比较详细的说明了编程流程。

请将树G的顶点数和带权邻接矩阵以及待求两点输入进input.txt。如果两点间无边连接，则 用大数65535来表示。-Please tree G, and with the right Vertices adjacency matrix, as well as for two points to be input into input.txt. If between two points limitless connectivity, is used to express large numbers 65,535.

一个精品课程网站，大家看看吧，看看有没有可取之处-Curriculum of a quality website, let us look at it to see if there is no merit

A*算法属于一种启发式搜索。它扩展结点的次序类似于广度优先搜索，但不同的是每生成一个子结点需要计算估价函数F，以估算起始结点到该结点的代价及它到达目标结点的代价的和；每当扩展结点时，总是在所有待扩展结点中选择具有最小F值的结点作为扩展对象，以便使搜索尽量沿最有希望的方向进行。 -A* algorithm is a heuristic search. It extended node in the order of priority similar to the breadth of search, but in every generation is a sub-node calculated valuation function F, to estimate initial node to the node, the price and it arrived at the target node, and the price; Whenever expansion node, the question has always extended to all nodes with the smallest choosing F value of the node as expansion targets, in order to search as far as possible along the most promising direction.

一些关于C++基础的集合，在面试时会用到的，有助于更好的学习C++的基础知识-some based on the C pool, the interviews will be used in the study contribute to a better basic knowledge of C

这些都是适合初学者的经典例子，初学不需要太难的程序，简单易懂的更能帮助学习C++的起步-some classic examples to help new hands to learn C++

一个java+sql2000开发超市销售系统，实现货品增删改查等管理。-A java+ Sql2000 development of supermarket sales system, additions and deletions to search such as goods management.

嵌入式ＰＤＡ程序，可以演示多线程的生成，并利用线程的方式刷新界面-embedded PDA procedures, multithreading can demonstrate the generation and use of high-thread interface

简单三国辅助工具 基本功能已全面-jiandangsanguofuzhugongju jibengongnengyiquanmian

用vc++画同心矩形，背景颜色，等都有所描述-Using vc++ painted concentric rectangle, background color, are described

一个用变形贪婪法解货郎回路的C程序代码 思想 1．选择一条最短的边作为部分解。 2．选择一条最短的且将之加入到部分解不形成回路的边。 3．重复第2步，直至所有的结点都包含在部分解中。-deformation with a greedy method for the Traveling Salesman circuit C code ideological one. Choose a minimum as part of the solution side. 2. Choose one of the shortest but to incorporate it into solutions that do not form part of the loop side. 3. Repeat Step 2 until all the nodes are included in some solution.