实现快速傅里叶变换和转换的程序用VB…

数据结构中常用的Gauss-Seidel 迭代算法-commonly used data structures, the Gauss- Seidel iterative algorithm

MFC实现的图书馆管理系统，希望对大家有用。-MFC library management system to achieve the hope for all of us.

1．定义图的数据结构。 2．编写函数，用邻接表实现图的存储结构，求图的顶点的度数。 3．编写函数，输出图的遍历序列。-1. The definition of graph data structure. 2. Write a function, using adjacency list implementation diagram of the storage structure, find the vertex of degree. 3. Write a function, the output graph traversal sequence.

教职工信息管理系统-staff of the Information Management System

Delphi SQL数据库浏览器。可以连接数据库并对表中的数据进行查询修改。

主要介绍了如何使用SQL语言编写高效简洁的数据库编程语句，提高数据库编程思想-Introduces how to use the SQL language simple and efficient database programming language, database programming to improve thinking

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

一个很好的VC＋＋　用ODBC编的-a good VC++ using ODBC series

2元树的先根遍历算法，中根遍历算法，后根遍历算法-2 yuan tree traversal algorithm first root, root traversal algorithm, after the root traversal algorithm

数据结构习题集答案，经多次修改而成，比答案册还要清楚简单。-data structure answer to the questions set by several revisions, but clearly the answer List simple.