iweoq FJ vnxcjoiaeafag dfgadfxae

骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n* n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vertical, horizontal or a vertical two-step further vaulting horse rules traveled a checkerboard lattice of each and every one lattice just take time.

病人管理系统是用来保持病人预约和病史。

先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树-First construct a map with the adjacency matrix is stored separately plym algorithm and then construct the minimum spanning tree algorithm克努斯卡尔

中缀变后缀表达式求值：输入表达式，#为结束符(如1+2#），程序会自动给出后缀表达式，并给出最终计算结果。程序中部分地方有注释-Variable postfix infix expression evaluation: Enter the expression,# to end the character (eg, 1+2#), the program will automatically give postfix expression, and gives the end result. Some parts of the program annotated

数据结构中单链表的源代码，该程序可以实现单链表的插入，删除，查找等基本功能-this program is very good

利用C语言实现两个多项式的加法，依次输入输入指数和系数，数据输入以（0，0）结束-use C language two polynomials additive, in order to import and importation index coefficient, data input to (0,0) end

40多版经典教材《数据结构》（严蔚敏、吴伟民著）全部代码实现。目录下TC是标准C代码C文件。VC是标准C++代码CPP文件。-More than 40 version of the classic textbook

利用Linklist实现超大整数之加减乘除-Linklist achieve large integers using the Math

C++ Builder程序员学习数据结构第6章-Builder C programmers to learn data structure Chapter 6

一个采用VC+ACCESS开发的酒店管理，以及论文-using a development of the VC ACCESS hotel management, and the papers