搜索资源列表
dfs
- 无向图的关键边,dfs邻接阵形式,O(n^2)-The critical edge of the undirected graph, dfs adjacency matrix form, O (n ^ 2)
hungary
- 二分图最大匹配,hungary算法,邻接阵形式,复杂度O(m*m*n)-Bipartite graph maximum matching, hungary algorithm, adjacency matrix form, complexity O (m* m* n)
11—矩阵按键(代码最少的)
- 单片机矩阵按键程序， 单片机系统中，若使用按键较多时如电子密码锁、电话机键盘等一般都至少有12到16个按键，通常采用矩阵键盘。 矩阵键盘又称行列键盘，它是用四条I/O线作为行线，四条I/O线作为列线组成的键盘。在行线和列线的每个交叉点上设置一个按键。这样键盘上按键的个数就为4*4个。这种行列式键盘结构能有效地提高单片机系统中I/O口的利用率。(Singlechip matrix button program)
DeepLearningDropout-master
- dropout和深度学习算法的结合使用，有详细的使用说明和数据集(Three types of layers: - C: convolutional layer (matrix map) - MP: max-pooling layer (matrix map) - F: fully connected layer (vector map) - O: output layer Convolutional Layers: - Scale: scale (size of p
内螺旋法
- 内螺旋法 矩阵编号 表示为连接顺序，从中间往外顺时针旋转，时间复杂度基本上就是O(N^2)了(The matrix number of the inner helix is expressed as the connection order, clockwise rotation from the center to the outside, and the time complexity is basically O (N^2))
Desktop
- 计算矩阵QR分解，A=Q[R;O] 可用于求解线性方程组 并附带利用QR分解解决LSE和LS的程序(To work out the QR decompose of a matrix)
矩阵运算程序
- 程序包含矩阵加减、转置和乘法的功能，用于学习动态内存分配、结构体、二级指针、文件I/O.(The program contains the function of matrix addition, subtraction, and multiplication, which is used to learn dynamic memory allocation, structure, two level pointer, file I/O)