Search - k matrix

Search - k matrix - List

[CSharp] c DL : 0: 本子程序根据所给的支路导纳及有关信息,形成结点--导纳矩阵,如打印参数K=1,则输出电导矩阵G和电纳矩B -Procedures based on the book of the slip road to the admittance and related information, the formation of node** admittance matrix, such as print parameters K = 1, the output conductance matrix G and the electric moment of B is satisfied
Date : 2025-12-29 Size : 18kb User : 张寒
[CSharp] BRMUL DL : 0: 求m*n阶矩阵A与n*k阶矩阵B的乘积矩阵C=AB-we can get the product matrix C from m*n matrix A and n*k matrix B.
Date : 2025-12-29 Size : 1kb User : 周美红
[CSharp] BCMUL DL : 0: 求m*n阶复矩阵A与n*k阶复矩阵B的乘积矩阵C=AB。-we can get product matrix C from m*n complex matrix A and n*k complex matrix B.
Date : 2025-12-29 Size : 1kb User : 周美红
[CSharp] dayin DL : 0: 编写螺旋方阵。其中螺旋方阵形式如下： 1 12 11 10 2 13 16 9 3 14 15 8 4 5 6 7 设row,column分别代表行、列坐标，变量p从1到n2将p依次存入数组a[row][column]中，要确定row、colomn的变化情况。分析如下：引进变量k，初值为n。当数据存入到左下角或右上角时，k减1，这样可保证输出时方阵。引进变量t，初值为1，当数据存入到右下角时，令t改变符合，当存入到左上角时，t又改变符合，这样可保证赋值到正确的数组坐标。 -Write spiral square. Square spiral form which is as follows: 1 12 1,110,213,169,314,158,456 7 set row, column representing the row, column coordinates, the variable p p from 1 to n2 will turn into an array a [row] [column], we must determine the row, colomn changes. As follows: the introduction of variable k, the initial value is n. When the data stored in the lower left or upper right corner when, k by 1, it will ensure that the output matrix. The introduction of variable t, the initial value is 1, when the data stored in the lower right corner, have resulted in changes consistent with t, the time when the deposit to the upper left corner, t and changing the match, it will ensure that the correct assignment to the array of coordinates.
Date : 2025-12-29 Size : 10kb User : 王一帆
[CSharp] k DL : 1: 　　对于稀疏矩阵的存储，可不使用二维数组来存储，而使用链表，只存储其中的非0元素。链表中的每个结点包含的域为（行，列，值, next），如以下稀疏矩阵： 0 2 0 0 0 3 0 0 0 6 0 0 0 0 0 0 0 7 0 0 　　则链表为：　　　　请实现两个稀疏矩阵的相加，并输出结果。要求：相加后原来的两个矩阵仍然存在。-For sparse matrix storage, without using the two-dimensional array to store and use the list, which stores only the non-zero elements. Fields included for each node in the linked list (row, column, values, Next), such as the following sparse matrix: 0,200,030,006,000,000,070 0 list is: The addition of two sparse matrix, and outputs the result. Requirement: the sum of the original two matrices persists.
Date : 2025-12-29 Size : 1kb User : hac
[CSharp] Floyd-CSharp DL : 0: 弗洛伊德(Floyd)算法主要是用于计算图中所有顶点对之间的最短距离长度的算法，如果是要求某一个特定点到图中所有顶点之间的最短距离可以用Dijkstra(迪杰斯特拉)算法来求。弗洛伊德(Floyd)算法的算法过程是： 1、从任意一条单边路径开始。所有两点之间的距离是边的权，如果两点之间没有边相连，则权为无穷大。 2、对于每一对顶点 u 和 v，看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比已知的路径更短。如果是更新它。把图用邻接矩阵G表示出来，如果从Vi到Vj有路可达，则G[i,j]=d，d表示该路的长度；否则G[i,j]=无穷大。定义一个矩阵D用来记录所插入点的信息，D[i,j]表示从Vi到Vj需要经过的点，初始化D[i,j]=j。把各个顶点插入图中，比较插点后的距离与原来的距离，G[i,j] = min( G[i,j], G[i,k]+G[k,j] )，如果G[i,j]的值变小，则D[i,j]=k。在G中包含有两点之间最短道路的信息，而在D中则包含了最短路径的信息。比如，要寻找从V5到V1的路径。根据D，假如D(5,1)=3则说明从V5到V1经过V3，路径为{V5,V3,V1}，如果D(5,3)=3，说明V5与V3直接相连，如果D(3,1)=1，说明V3与V1直接相连。 -Floyd (Floyd) algorithm is mainly used to calculate the length of the shortest distance between the drawing algorithm between all pairs of vertices, if the requirements of a specific point to the diagram all the shortest distance between vertices can Dijkstra (Dinger Stella) algorithm to find. Floyd algorithm process (Floyd) algorithm is: 1, starting any one-sided way. The distance between two points is all right edge, if there is no edge connected between two points, the right to infinity. 2. For every pair of vertices u and v, and see if there is a vertex w such that w u to v and then shorter than the known path. If you are updating it. Figure that out of the adjacency matrix G, if there is a road up Vi to Vj, then G [i, j] = d, d represents the length of the path otherwise G [i, j] = infinity. Define a matrix D used to record the information of the inserted point, D [i, j] represents Vi to Vj need to go through the points, initialize D [i, j] = j. The inset in e
Date : 2025-12-29 Size : 2kb User : 焦慧明