1、读入城市结点数据 */ /* 2、邻接矩阵初始化：所有元素赋Infinity， */ /* 对角线元素赋0 */ /* 3、读入城市间边...

前一阵出去玩了，补回还差的2个，里面包括上次上载的一共5个，另加个汇编程序，是课堂实验-play out a little while ago, to compensate for the worse two, including the inside on the last of a total of five, plus a 000 assembler, a classroom experiment

以十字链表表示稀疏矩阵,实现两个矩阵的相加,相减,和相乘的运算.-List said with a crossbow sparse matrix, the matrix to achieve two together, subtraction, multiplication and arithmetic.

航空票务预订系统-Air Ticket Booking System

如何插入、 删除和显示通告链接双重链接的列表。菜单驱动的程序与灵活的列表的大小。此外包括验证、 评价和中缀、 前缀和后缀表达式的转换。所有的代码写在 c 语言和签入 codeblocks。

数据设计课程实验，二叉树存储设计源码，c语言编写。-Data design course experiments, binary storage design source, c language.

最小生成树问题 若要在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.

dfgdsfg sdfg dsfg dfsg dsfg dsfg sdf gsdg sdg sdfg sdgdsfg

Matlab应用篇提供了大量的Matlab应用实例。配合前三篇所讲内容，巩固Matlab知识。-Matlab Application chapter provides a large number of application examples Matlab. Compatible with the three have said, the consolidation of Matlab knowledge.

CBASE v1.01 采用Borland公司TC++编写的数据库管理源程序库-CBASE v1.01 using Borland TC prepared by the source database management library

/*数字三角形问题 问题描述： 给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法,计算出从三角形的顶至底的一条路径,使该路径经过的数字总和最大。 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 编程任务： 对于给定的由n行数字组成的数字三角形,编程计算从三角形的顶至底的路径经过的数字和的最大值-/* Digital triangle Issue Description : given an OK by the number n of triangular figures shown in the diagram below. Design of a test algorithm, calculated from the top of the triangle to the end of a path, the path through the largest sum of the figures. 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 programming tasks : for a given n line by the number of digits triangle, triangle programming calculated from the top to the bottom of the path through the figures and the maximum