There is a chance to appreciate different ways of life.

用c做的图的数据结构的作业,建立有向图,深度广度搜索,分为递归和非递归方式.-C to do with the map data structure operations, the establishment has to map the depth of breadth of search, is divided into recursive and non-recursive way.

数据库基础知识的笔记题集,对初学者进行复习很有用-database

这是一个关于 Hough 变换的文件。它是非常有趣的人，开始为图像处理批准。感谢你很 much.ok。

通过修改access数据库的头文件来达到加密数据库的目的，在VC6.0平台上运行良好，已通过测试-Access the database by modifying the header files to achieve the purpose of encrypting the database, in VC6.0 platform to run well, has been tested

编写一程序，统计学生的成绩信息（保存在文件Score.dat中）。 要求： 1. 能按总分，数学成绩，英语成绩，计算机成绩分别排序 2. 能分别统计数学，英语，计算机中不及格人数 3. 能按学号查找学生，并显示该学生信息。 注 1. 从文件中读入数据以及功能菜单显示已在文件ReadData.c 和Menu.c中给出； 2. 代码的总体结构已在文件Score.c中给出，并定义了一些函数头，但有关函数体代码和一些主程序处理代码要求学生填写，也可以修改函数头； 编译score.c即可 -prepared a procedure, the results of the students statistical information (stored in the document Score.dat). Requirements : 1. According to score, the math and English results, the computer results were 2 ranking. Statistics were able to mathematics, English, Computer failure number three. can search by school, students, and that the student information. Note 1. Read from the file into the data and functions of the menu showed the documentary and Menu.c ReadData.c given; 2. The overall code structure has been the Score.c given, and the definition of some of the first function, However, the body function code and address some main program code requiring students to complete, can also modify function first; compiler can s

数据结构二叉树的实现-binary tree data structure to achieve

迷宫问题与运动会,有丰富的实例与测试数据，是学习数据结构的较好的资料！-Maze with the Games, has a wealth of examples and test data, data structure to learn the information better!

一元稀疏多项式计算器[加法和乘法] 问题描述： 设计一元系数多项式计数器实现两个多项式间的加法、减法。 基本要求： （1） 输入并建立多项式 （2） 输出多项式，输出形式为整数序列：n，c1，e1，c2，e2……cn，en，其中n是多项式的项数，ci，ei分别为第i项的系数和指数。序列按指数降序排列。 （3） 多项式a和b相加，建立多项式a+b，输出相加的多项式。 （4） 多项式a和b相减，建立多项式a-b，输出相减的多项式。 用带表头结点的单链表存储多项式。 测试数据： (1) (2x+5x8-3.1x11)+(7-5x8+11x9) (2) (6x-3-x+4.4x2-1.2x9)-(-6x-3+5.4x2+7.8x15) (3) (x+x2+x3)+0 (4) (x+x3)-(-x-x-3)-one yuan sparse polynomial calculator [Addition and multiplication] Problem description : Design one yuan polynomial coefficient counter achieve the two polynomials addition, subtraction. Basic requirements : (a) input and the establishment of polynomial (2) output polynomial, the output form of integer sequence : n, c1, e1, c2, e2 ... cn, en, where n is the polynomial Number, ci, ei for the first item i the coefficients and indexes. By sequencing index in descending order. (3) a and b polynomial addition, the establishment of a polynomial b, the combined output polynomial. (4) a and b polynomial subtraction, the establishment of a polyno

树结构之线索话二叉树，二叉树的存储结构，线索二叉树的构造。中序线索化，递归算法，非递归算法。