代码搜索：矩阵分析
找到约 10,000 项符合「矩阵分析」的源代码
代码结果 10,000
www.eeworm.com/read/264446/11314560
opt 稀疏矩阵.opt
www.eeworm.com/read/264446/11314563
dsp 稀疏矩阵.dsp
# Microsoft Developer Studio Project File - Name="稀疏矩阵" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Cons
www.eeworm.com/read/264446/11314572
exe 稀疏矩阵.exe
www.eeworm.com/read/264446/11314580
ncb 稀疏矩阵.ncb
www.eeworm.com/read/264155/11327574
cpp 稀疏矩阵.cpp
#include
typedef struct mnode//定义十字链表
{ int row,col;
struct mnode*down,*right;
union { int v;
struct mnode*next;
} v_next;
}mnode,*mlink;
mlink creatml
www.eeworm.com/read/405283/11466938
c 逆矩阵.c
#define N 5 /*[注]：修改6为你所要的矩阵阶数*/
#include "stdio.h"
#include "conio.h"
/*js()函数用于计算行列式,通过递归算法实现*/
int js(s,n)
int s[][N],n;
{int z,j,k,r,total=0;
int b[N][N];/*b[N][N]用于存放，在矩阵s[
www.eeworm.com/read/405283/11466970
c 乘法矩阵.c
#include
void main()
{
int i,j;
int big[8][8];
for (i = 0;i < 8;i++) /*循环嵌套*/
for (j = 0;j < 8;j++)
big[i][j] = i * j; /* 乘法表 */
big[2][6] = 748;
www.eeworm.com/read/405283/11467064
c 矩阵转换.c
void trans(int *p,int n)
{
int i,j,temp;
int *pi,*pj;
for(i=0;i
www.eeworm.com/read/157762/11665877
cpp 稀疏矩阵.cpp
#include
using namespace std;
#define MAXSIZE 12500
#define OK 1
#define ERROR 0
typedef int status;
typedef int Elemtype;
typedef struct{
int i,j;
Elemtype e;
}Triple;
typedef