稀疏矩阵的十字链表算法-sparse matrix algorithm Cross Chain 下载
|
数据结构中稀疏矩阵的十字链表存取表示，加，减，乘，除等常用算法-data sparse matrix structure of the Cross access Chain said, plus or minus, by, among other commonly used algorithm 下载
|
数据结构中关于十字链表的实现，十字链表可以很好的对稀疏矩阵进行效率很高的存储和计算。比如在通信纠错编码的ldpc编译码中就要用到这种数据结构-data structure on the realization of Chain Cross, Cross List can be good for sparse matrix highly efficient storage and computing. For example, in communications-correction coding ldpc encryption it is necessary to use this data structure 下载
|
采用十字链表的稀疏矩阵运算器////////////////-Cross Chain using sparse matrix operations for //////////////// 下载
|
编制一个算术表达式求值的程序 （1）以十字链表表示稀疏矩阵，实现两个矩阵相加，相减和相乘的运算。稀疏矩阵的输入形式采用三元组表示，而运算结果的矩阵则以通常的阵列形式列出。 （2）首先应输入矩阵的行数和列数，并判别给出的两个矩阵的行、列数对于所要求作的运算是否匹配。 （3）程序对三元组的输入顺序没有特定的要求，可以以任何的次序输入，程序会对其进行查找，插入到适合的位置上。 （4）在用三元组表示稀疏矩阵时，相加或相减所得结果矩阵应该另生成，乘积矩阵也用十字链表存放。 -compiled an arithmetic expression evaluates procedures (1) with a crossbow chain said sparse matrix, 2 matrix to achieve together, subtract and multiply arithmetic. Sparse Matrix input form using ternary group, and the results of the matrix operation was the usual array listed. (2) should first input matrix number of rows and columns, and discriminant given two Matrix OK, Columns for the required for the operation would match. (3) procedures for the importation of triple sequence is no specific request, in any order of entry, its procedures for identifying, inserted into the appropriate location. (4) using triple said sparse matrix, additive or subtraction results matrix should be another generation, Matrix also used the product Cross Chain store. 下载
|
以十字链表表示稀疏矩阵,实现两个矩阵的相加,相减,和相乘的运算.-List said with a crossbow sparse matrix, the matrix to achieve two together, subtraction, multiplication and arithmetic. 下载
|
十字链表实现稀疏矩阵求和，没什么特殊说明的，算法都是严氏教材上的经典算法，实现方法很容易-sparse matrix to achieve peace, nothing special note, the algorithm are heroic materials on the classical algorithm method is easy 下载
|
稀疏矩阵 1、 应用程序 直接可以实现矩阵的各项操作。 2、 查看原代码VC++6.0打开“稀疏矩阵\creatematrix.dsp”或者用记事本打开“稀疏矩阵\creatematrix.cpp” 3、 代码简单说明: 本程序是一个工程文件包含了链式与顺序两种多项是处理方式： 十字链表：矩阵的结构体：matnode； 三元组顺序：矩阵结构体：tsmat 4、ADT在文件夹“稀疏矩阵”里 -a sparse matrix, the application can be achieved directly by the matrix operation. 2, VC View 6.0 source code open "Sparse Matrix \ creatematrix.dsp" or use Notepad to open the "sparse matrix \ creatematrix.cpp" 3, code simple note : this program is a project file contains a sequence of two chain with a number of approaches : Cross Chain : the structure of the matrix : matnode; Triples order : the structure matrix : tsmat 4, ADT in the folder "Sparse Matrix" -- 下载
|
十字链表是这样构成的：用链表模拟矩阵的行（或者列，这可以根据个人喜好来定），然后，再构造代表列的链表，将每一行中的元素节点插入到对应的列中去。书中为了少存几个表头节点，将行和列的表头节点合并到了一起——实际只是省了几个指针域，如果行和列数不等，多余的数据域就把这点省出的空间又给用了。这点小动作让我着实废了半天劲，个人感觉，优点不大，缺点不少，不如老老实实写得象个十字链表，让人也好看一些，这是教科书，目的是教学。实在看得晕的人，参阅C版的这部分内容，很清晰。我也不会画图，打个比方吧：这个十字链表的逻辑结构就像是一个围棋盘（没见过，你就想一下苍蝇拍，这个总见过吧），而非零元就好像是在棋盘上放的棋子，总共占的空间就是，确定那些线的表头节点和那些棋子代表的非零元节点。最后，我们用一个指针指向这个棋盘，这个指针就代表了这个稀疏矩阵-Crusaders is the form : Chain Simulation matrix rows (or out, This can be based on individual preferences to be), and then constructed on behalf of the chain out, Each line of the elements inserted into the node corresponding to the series. To book a few small depositors table first node, out of line and the first node table to merge together -- the reality is that a number of indicators provincial jurisdictions, if the number of rows and columns ranging, redundant data domain put this province has granted the use of the space. This little trick I did waste a half-day efforts, personal feeling, not merit, a lot of shortcomings, written as honestly as cross chain, some people are good looking, which is the textbook, and the purpose of teaching. Really see the halo, see the C version of this 下载
|