This program use for topological sorting

strassen算法的扩展，可以计算任何偶数阶矩阵的相乘，一般strassen只能计算2的n次方阶（自己编写，英文注释~）-Strassen expansion algorithm can even order any calculation of matrix multiplication, general Strassen only two terms of the n-th-order (to prepare themselves, English Notes ~)

实现岛上建立公路的最短路径算法，调用了dikstra算法-Highway on the island to achieve the establishment of the shortest path algorithm, called algorithm dikstra

DataBase development

1. 在IBConsole中添加两个用户LOGIN和MATER，密码均为PASSWORD。 2. 用MISDBA用户登录MISDB数据库。 3. 在ISQL中，输入第9章提供的SQL语句；或者根据表9-1至表9-8在SQL Explorer中自行创建数据表。数据库创建后需要分配LOGIN和MATER用户的访问权限。 4. 根据表9-9和表9-10设置初始数据，另外需要在PERSON数据表中设置一个用于登录系统的用户（ID=’MAT’，PASSWD=’PASSWORD’，AUTHORITY=’7’，STATE=’F’），同时在PART表中添加ID为’0000000000’的零件，名称为“。 5. 除了修改数据库连接的属性，还需要修改数据模块中LOGIN方法的相关用户密码。 -1. In addition two IBConsole users LOGIN and Mater. passwords are PASSWORD. 2. User login with MISDBA MISDB database. 3. In ISQL, the importation of Chapter 9 of SQL; Or, according to Table 9-1 to Table 9-8 in SQL Explorer to create data sheets. After creating the database needs and Mater distribution LOGIN user access permissions. 4. According to Table 9-9 and Table 9-10 initial data set, Another need PERSON data tables set up a registration system for users (ID = "MAT" PASSWD = "PASSWORD" AUTHORITY ="7 ", STATE = "F"), PART table at the same time adding ID to"0000000000 "parts, name. " 5. In add

数据结构 详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of

VHDL实现布斯算法-VHDL Booth algorithm

这是我做数据结构课程设计里面的一个设计程序，二叉树排序-This is my curriculum design make the data structure inside a well-designed procedures, binary tree sort

演示一个寻找最短路径的算法。-find a demonstration of the shortest path algorithm.

//希尔排序void ShellSort(int r[], int n){ int i; int d; int j;    for (d=n/2; d>=1; d=d/2)            //以增量为d进行直接插入排序 {     for (i=d+1; i0 &am

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.