李纯

Editor 的检讨后，你会得到 0 10 CF 硬币。您的源代码，你会得到更多的 CF 硬币质量越好。请仔细填写以下各节。

摘要：可以对本地数据库进行查看，修改的程序，提供了源代码。-Abstract : It is the local database view, the procedures for amendment, the source code.

三层数据库考试系统，很不错的，大家可以看看。-Three-tier examination system database, it is good, we will look at.

求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.

一个作的很好的dao数据库开发，值得一看。-one for the good dao database development overseas.

出入口控制管理程序实现对各种人员通道，车辆通道出入的记录、抓拍控制等应用管理

严蔚敏经典教材《数据结构》的算法源码和实验演示系统-Data Structure

0-1背包问题的动态规划求解算法, 0-1背包不同于背包问题-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem

经典矩阵运算问题求解-classic problem solving matrix operations

栈的应用-表达式求值2                                                                                                                                                                                                           ..............................................................................................................................................................................