一个最短路径算法，具体内容程序开头有介绍

实现如何上传图片等数据，并存储其至数据库的源码-How do I upload pictures to achieve the data and store it to database source

算法设计于分析中的多段图问题，用VC编写应用动态规划的算法设计方法，利用最优性原理以及所获得的递推关系式求取最优决策序列，通过多段图的定义，找到由源点s到汇点t的最小成本路径，进而可以灵活解决可以用多段图描述的许多实际问题.-algorithm design in the analysis of many of the map, prepared with VC dynamic programming algorithm design, the optimum principle as well as the recursive relation to strike the optimal sequence of decision-making through more of the map defined by the source to find s t point to the Department of the minimum cost paths and further a flexible solution could spend more of the map describes the many practical problems.

/*最大k乘积问题 问题描述: 设I是一个n位十进制整数。如果将I划分为k段，则可得到k个整数。这k个整数的乘积称为I的一个k乘积 。 试设计一个算法，对于给定的I和k，求出I的最大k乘积（n

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data node must be small (large) in the node data. Order traversal of binary tree that is the result of a sort.

摘要 　? 　? 　　 　　设计时的自动化加快了编码，并保证所有过程都用相同的命名规范和结构来生成。为了在大型 SQL 项目中尽量提高编码的效率，作者编写了一系列的设计时（design-time）存储过程，用它们来生成运行时（run-time）存储过程，并一直在工程中使用。最近，作者更新了其存储过程以便使用 SQL Server 2000 的特性，其中包括用户定义函数。本文所及内容涵盖创建并执行这些动态 T-SQL 脚本以使普通的数据库存储过程编码自动化。- Time the abstract design automation sped up the code, and guarantee all processes all use the same naming standard and the structure produce. In order to enhances the encoded efficiency as far as possible in the large-scale SQL project, the author has compiled when a series of designs (design-time) saves the process, produces when the movement with them (run-time) saves the process, and always uses in the project. Recently, the author renewed its memory process in order to use SQL the Server 2,000 characteristics, including user definition function. This article institute and the content cover founds and carries out these dynamic T-SQL script to cause the ordinary database memory process code automation.

这是VFP的指导思想书籍，主要说明了开发软件时怎么样才做到界面与数据分离，从而在日后的维护中带来便利-This is the guiding ideology of books, mainly, the development of the software how to achieve just like interface and data separation, in order to safeguard the future brings convenience

这是一个有序链表的生成和插入的源码。用C++实现。-This is an orderly list of the generation and insertion of the source. With C++ Realize.

C++控制台程序，在不知道城市方位的情况下对某个城市的餐馆和小吃店进行导航定位。使用链表数据结构，采用继承的方式进行类的编写实现餐馆导航。

各种常用的排序算法的演示程序， 以顺序表作为存储结构～～～～ 欢迎大家指正-A demo for different sort arithmetic,use qlist as store type. welcome ues and question

资源描述数据结构第三章课后题二叉树，对于初学数据结构有很大的帮助