代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/211340/7153114
h graph4.h
//图类结构体定义与相关操作graph4.h
typedef struct
{char *data;
int *visited;
float **edge;
int max,size;
}Graph;
//初始化图
void SetGraph(Graph *G,int n)
{int i,j;
G->data=new char[n];
G->visited=new
www.eeworm.com/read/464179/7167955
h creat.h
//--------------------------------构造图------------------------------------------//
void creatGraph(ALGraph *G,char *fi)
{//输入各个顶点及弧的信息构造图
int i,j,k;
int w;
char v1[10],v2[10];//图顶点名最长10个字符
www.eeworm.com/read/464179/7167957
h shortest.h
//-----------------------------------求最短路径-----------------------------------//
void shortestpath(ALGraph *G,char *sou,char *dest)
{//得到从sou始的所有顶点的最短路径
int i,v=-1,w,k,j;
int **p,*final;
unsign
www.eeworm.com/read/463988/7171112
c bigintfactoria.c
/* 大整数的阶乘 */
/* 化乘法为加法 */
#include
#include
#define MAXN 1000
void pnext(int a[], int k) /* 已知a中的k-1的阶乘,求出k的阶乘 */
{
int *b, m=a[0], i, j, r, carry;
b = (int *
www.eeworm.com/read/462729/7197388
txt ch5_20.txt
JD *zxxsh(JD *bt)
{ JD *p,*pr,*s[M],*t;
int i=0;
t=(JD *)malloc(sizeof(JD));
t->lt=0;
t->rt=1;
t->rc=t;
if(bt==NULL)
t->lc=t;
else
{ t->lc=bt;
pr=t;
www.eeworm.com/read/462726/7197459
txt ch3_3.txt
JD *lzjz(JD *top,int x)
{ JD *p;
p=(JD *)malloc(sizeof(JD));
p->data=x;
p->link=top;
top=p;
return(p);
}
www.eeworm.com/read/462726/7197477
txt ch2_6.txt
JD* dlbjl(int a[],int n)
{
JD *s,*h;
int i;
h=(JD*)malloc(sizeof(JD));
h->data=0;
h->link=NULL;
for(i=n;i>0;i--)
{s=(JD*)malloc(sizeof(JD));
s->data=a[i-1];
s->link=h->link;
h-
www.eeworm.com/read/462721/7197493
txt ch3_3.txt
JD *lzjz(JD *top,int x)
{ JD *p;
p=(JD *)malloc(sizeof(JD));
p->data=x;
p->link=top;
top=p;
return(p);
}
www.eeworm.com/read/462721/7197511
txt ch2_6.txt
JD* dlbjl(int a[],int n)
{
JD *s,*h;
int i;
h=(JD*)malloc(sizeof(JD));
h->data=0;
h->link=NULL;
for(i=n;i>0;i--)
{s=(JD*)malloc(sizeof(JD));
s->data=a[i-1];
s->link=h->link;
h-
www.eeworm.com/read/462246/7205904
c 新建 文本文档.c
#include
#include
#include
#define TRUE 1
#define FALSE 0
int N;//数据个数
int K;//集合个数
int * CenterIndex;//初始化质心数组的索引
double * Center;//质心集合
d