May realize a web service database query, update, delete a feature, simple and d...

Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a

our homework big project

全国计算机等级考试四级上机的部分练习题，配有我自己写的算法，算法说明和输入输出文件，使实验起来更容易。算法比较简洁易懂，大概有三十题左右（已经去掉了重复和类似的），对考四级的朋友和正在学习C的朋友会有帮助的-National Computer Rank Examination four aircraft on the part Exercises, equipped with my own writing algorithm, the algorithm description and input and output documents, and make it easier to experiment. Algorithms easy to read, there are about 30 or so that (already removed the duplication and similar), the examination of the four friends are learning C and friends can be helpful

本程序是以图形化，慢动作显示经典棋盘覆盖算法问题。-This procedure is based on graphical, slow-motion show the classic board covering algorithm problem.

组合问题，从M个不同字符中任取N个字符的所有组合-Combination of issues, from the M different characters of any N-character check all combinations

sms develop use kfxt and mscomm and suce-sms develop and use kfxt mscomm and suce

是一种数据结构的算法，实现一种简单的数据计算功能-is a data structure of the algorithm to achieve a simple function data

此函数功能是图的遍历算法，用邻接矩阵存储图，然后求出其拓扑排序，再输出其图的信息-Function is to map the function of the traversal algorithm, the adjacency matrix storage map, then calculated the topological sort, then the output of its map information

这里有一些数据结构中的通用算法，拿出来和大家共享了◎-Here are some of the generic data structure algorithms, up to and everyone shared ◎

学校超市选址问题（带权有向图的中心点）