严蔚敏编写的《数据结构》第9章的答案，全部为源码

为了给世纪互联做一个项目，从淘宝指数上抓取的全国省市经纬度坐标，非常好用。附赠全国动态地图示例demo。由于资源是动态引入的，不能file直接访问，要布再www服务器

最小生成树的prim算法 是求图中的最短路径的一个重要算法 但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm

本人原创（delphi程序设计提高与应用）源码。本实例利用ADO组件与Access数据库连接，并可将其中的数据表中的数据生成word报表及Excel文件。源码中几乎所有的步骤都有详尽的说明，是delphi初级数据库编程人员快速进入状态的实用案例。-My original (delphi improve program design and application) source. The examples of the use of ADO components with the Access database connection, the data could be data in the table below to generate word statements and Excel documents. Source of almost all the steps are very detailed, is the primary database delphi programmers to quickly enter the state of practical cases.

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees

使用powerbuilder开发的小型超市管理系统。 请查阅。-Use PowerBuilder to develop a small supermarket management system. Please check.

广义表的头文件简单实用，一般般的操作都有说明。-Generalized table header file is simple and practical, generally have been described as the operation.

files about dsp applications control

这是一个用PB和SQL SERVER做的课程设计,模拟完成了,银行的开户,销户,存款,取款等功能.-with PB and SQL SERVER do curriculum design, simulation completed, the bank accounts, and marketing of households, deposits, withdrawals and other functions.

完全采用指针编写的字符串排序程序，共两种方法，调试过-completely prepared by the string pointer ranking, with a total of two methods tuned

数据结构常用算法之一-Dijkstra算法,实现最短路径选择.-algorithm commonly used data structures one-Dijkstra algorithm to achieve the shortest path to choose.