一个简单的通讯录，是暑期的课程实践期间找的，感觉很好用，有查找，删除等功能1...

最小生成树问题用lingo9.0程序实现-Minimum spanning tree problem lingo9.0 procedures used to achieve

数据结构 银行程序-data structure banking procedures

电脑排课(普通不过的)-course timetable by computer(very normal)

栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进者先出，即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器，每次只可以从顶端压入一个硬币，而取出也只可以从顶端进行，即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如，编译系统中(这是一类比较复杂的程序)，对于函数调用的处理、对于表达式计算的处理，都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently meets the vitality one kind of construction of data form under, it has such characteristic regarding data depositing and the operation: 1) it only has a logarithm according to the port which carries on stores and takes out; 2) less advanced first leaves, namely finally the data which will store first is taken out. Its form looks like one kind of memory coin very much the small container, each time only may press in a coin from the peak, but takes out also only may carry on from the peak, namely less advanced first leaves. Such data storage and the management form are very useful in some programmings. For example, in the compiling system (this is a kind of quite complex procedure), transfe

用邻接矩阵的形式实现了求有向图的强连通分量。-Adjacency matrix with the form of a demand directed graph strongly connected component.

高斯列主元消元法， 这只是我个人的一种解法，仅供参考。-out PCA Gaussian Elimination Act, this is my personal one solution for reference.

经典的八皇后问题，结合MFC界面编程，能够清晰看到皇后的排列位置。-eight Queen"s classic, combining MFC programming interface, can see clearly what the position with the Queen.

数据结构中的各种各样的排序算法-data structure of a variety of Sorting Algorithm

数据结构。拉格朗日插值法算法。通过拉格朗日算法求方程-Data structure. Lagrange interpolation algorithm. Through the Lagrange method of Equation

资源描述利用三元组实现矩阵的简单运算，包括矩阵加法、减法、乘法和置换的运算，同时利用QT实现了简单的页面。本资源利用了三元组对矩阵进行运算，时间性能大大增加。