Jay98的博客

Stack CreateStack( int MaxElements ){ Stack s=malloc(sizeof (struct StackRecord)); s->Array=(int *)malloc(MaxElements*(sizeof (int))); s->Capacity=MaxElements; s->Top1=-1; s->Top2=s->Capacity; return s;}int IsEmpty(

Deque CreateDeque(){ PtrToNode head = malloc(sizeof(struct Node)); head->Next=head->Last=NULL; Deque D=malloc(sizeof (struct DequeRecord)); D->Front=D->Rear=head; return D;}int Push( ElementType X, Deque D ){ PtrToNode

void ShortestDist( MGraph Graph, int dist[], int path[], Vertex S ){ int vis[MaxVertexNum]={0},n=Graph->Nv; for(int i=0;i<n;i++){ dist[i]=INFINITY; path[i]=-1; } dist[S]=0; for(int i=0;i<n;i++){ int min=

void ShortestDist( MGraph Graph, int dist[], int count[], Vertex S ){ int vis[MaxVertexNum]={0},n=Graph->Nv; for(int i=0;i<n;i++){ dist[i]=Graph->G[S][i]; count[i]=0; } //vis[S]=1; dist[S]=0; count[S]=1;

void merge_pass( ElementType list[], ElementType sorted[], int N, int length ){ int h1=0,e1=length-1,h2=length,e2=2*length-1; //h1、h2分别是两个归并数组的开头，e1、e2是结尾 int k=0,last=0; while(1){// printf("%d %d - %d %d\n",h1,e1,h2,e2); if(e2&

int vis[MaxVertexNum]={0};void DFS(LGraph Graph,int v){ vis[v]=1; PtrToAdjVNode p=Graph->G[v].FirstEdge; while(p){ if(vis[p->AdjV]==0){ DFS(Graph,p->AdjV); } p=p->Next; }}int CountConnecte

代码：bool TopSort( LGraph Graph, Vertex TopOrder[] ){ int k=0,n=Graph->Nv,v; PtrToAdjVNode p; int stack[MaxVertexNum],top=-1; int inDegree[MaxVertexNum]={0}; for(int i=0;i<n;i++){ //统计入度 p=Graph->G[i].FirstEdge;

void ShortestDist( MGraph Graph, int dist[], Vertex S ){ int n=Graph->Nv; for(int i=0;i<n;i++){ dist[i]=Graph->G[S][i]; } int vis[MaxVertexNum]={0}; vis[S]=1; dist[S]=0; int min,v; for(int i=0;i<n;i++){

void ShortestDist( LGraph Graph, int dist[], Vertex S ){ for(int i=0;i<Graph->Nv;i++){ dist[i]=-1; } int vis[MaxVertexNum]={0}; PtrToAdjVNode p; vis[S]=1;// printf("%d ",S); dist[S]=0; int queue[MaxVertexNum]={

堆节点的插入：void PercolateUp( int p, PriorityQueue H ){ //插入时，小的数字向上调整 int i; int temp=H->Elements[p]; for(i=H->Size;temp<H->Elements[i/2];i/=2){ //当插入的数字小于父节点则向上调整 H->Elements[i]=H->Elements[i/2]; } H->Element

int Isomorphic( Tree T1, Tree T2 ){ if(!T1&&!T2) return 1; else if(T1&&T2){ if(T1->Element==T2->Element){ int b1=Isomorphic(T1->Left,T2->Left)||Isomorphic(T1->Left,T2->Right);

ElementType EvalPostfix( char *expr ){ double s1[10],t; int top1=-1,top2=-1,l=strlen(expr),neg=0; char s2[10]; for(int i=0;i<l;){ if(expr[i]=='-'&&expr[i+1]!=' '&&i!=l-1){ neg=1; i++;

Polynomial Add( Polynomial a, Polynomial b ){ Polynomial s=(Polynomial)malloc(sizeof (struct Node)); Polynomial p=a->Next,q=b->Next,r=s; while(p&&q){ if(p->Exponent>q->Exponent){ r->Next=p;