Search - k matrix

Search - k matrix - List

[Data structs] Prim DL : 0: 用prim算法实验最小生成树本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.
Date : 2025-12-29 Size : 92kb User : Tina612
[Data structs] report+of+Algorithm DL : 0: 算法设计的实验报告包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge Sorting Algorithm, Insertion Sort algorithm creation Heaps Heap, Heap Sort algorithm, according to rank and merge algorithm with path compression algorithm to find the first small element K algorithm, the realization of quick sort algorithm, the realization of planar within the nearest point on the algorithm to achieve the longest common sub-sequence algorithm, the realization of matrix-chain multiplication algorithm, the realization of 0/1 knapsack problem algorithm Dijistra s algorithm, Prim algorithm, Kruskal algorithm, file compression algorithm
Date : 2025-12-29 Size : 28kb User : 苏宁
[Data structs] sitelasijuzhen DL : 0: 斯特拉斯矩阵的算法实现，可以运行，希望可以帮到大家-K matrix algorithm, you can run, I hope you can help
Date : 2025-12-29 Size : 512kb User : yang
[Data structs] metis-5.0pre2.tar DL : 0: 软件包Metis是由美国密西根大学G．Karypis和V．Kumar编写的用于图的分区和稀疏矩阵排序的串行包，提供多级k路图分区法对混合网格进行分区。-Metis package by the University of Michigan G. Karypis and V. Kumar, prepared for the graph partitioning and sparse matrix ordering of the serial package, providing multi-level partitioning method k road map to partition the mixed grid.
Date : 2025-12-29 Size : 1.68mb User : flo
[Data structs] 44 DL : 0: 给定程序中，函数fun的功能是：将a所指3×5矩阵中第k列的元素左移到第0列，第k列以后的每列元素依次左移，原来左边的各列依次绕道右边。例如，有以下矩阵： 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 若k结果为2，程序执行结果为： 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 请在程序的下划线处填入正确的内容并把下划线删除，使程序得出正确的结果。注意：源文件存放在考生文件夹下的BLANK1.C中不得增行或删行，也不得更改程序的结构！ -A given program, function fun feature is: a 3 × 5 matrix referred to in the first k elements of the left column to move Section 0, the k elements of each column after column followed by the left, the original columns in the left turn Bypass on the right. For example, the following matrix: 123,451,234,512,345 If k is 2, the program execution results: 345,123,451,234,512 in the program underscore the right content at the fill and to remove the underscore, so that the program reach the right result. Note: The source files in the folder of BLANK1.C candidates are not allowed by the line or delete line, nor change the structure of the program!
Date : 2025-12-29 Size : 4kb User : 储谢东
[Data structs] aaa DL : 0: 给定一个k值在任意一个n阶矩阵中找出最长且最接近k的一条路径-Given a k value in any of the matrix of order n to find the longest and closest to the path of k
Date : 2025-12-29 Size : 787kb User : 依然