电子词典

根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current situation

软件工程 卡耐基 数据库 ssd7 ex1-ssd ex1

DAO操作Access数据库类，提供测试程序-Access Database DAO type operation, procedures for testing

数据结构经典：《数据结构基础》 "Fundamentals of Data Structures" 作者：Horowitz 1983年第一版-Classical data structure:

这个程序使用递归解决汉诺塔游戏的问题。 这个程序将所有盘从嘴左边的指针处移动到最右边，并满足以下要求1) 一次仅移动一个盘子.2)移除的盘子必须放到一个指针下面 3)大盘子不能放在小盘子上面

自底向上排序：思想: 将数组的个部分,两两有序数组进行合并 算法平均时间复杂度: O(nlogn) -Bottom-up sequencing: thinking: The array of parts 22 in an orderly array merge algorithm for the average time complexity: O (nlogn)

N皇后的排列树与子集数算法！里面是Cpp的源代码 带注释-N Queen subset of the arrangement of trees and the number of algorithms!

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function

求解网络中的最短路径。假设某个计算机网络有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.

教务辅助管理系统利用VB开发的数据库管理系统,里面分学生,教师,教务等等各方面的需求满足学校的教务管理的简单需求!-Senate Assistant Management System Using VB development of the database management system, which, students, teachers, Senate, the areas of the school to meet the needs of the academic management of the simple demand!