#include <stdio.h> #include <stdlib.h> #include <string.h> #include <malloc.h> #define MAXV 1000 #define ElemType int #define INF 32767typedef struct { int no; int info; }VertexType; typedef struct{ int edges[MAXV][MAXV]; int n,e; VertexType vexs[MAXV]; }MatGraph; typedef struct ArcNode{ int adjvex; int weight; struct ArcNode *nextarc; }ArcNode; typedef struct VNode{ VertexType data; ArcNode *firstarc; }VNode,AdjList[MAXV]; typedef struct{ AdjList adjlist; int n,e; }AdjGraph; void CreateAdj(AdjGraph *&G,int A [MAXV][MAXV],int n,int e){ int i,j;ArcNode *p; G=(AdjGraph *)malloc(sizeof(AdjGraph)); for(i=0;i<n;i++) { G->adjlist[i].firstarc=NULL; } for(i=0;i<n;i++) { for(j=n-1;j>=0;j--) { if(A[i][j]!=0 && A[i][j]!=INF) { p=(ArcNode *)malloc(sizeof(ArcNode)); p->adjvex=j; p->weight=A[i][j]; p->nextarc=G->adjlist[i].firstarc; G->adjlist[i].firstarc=p; } } } G->n=n;G->e=e; }MatGraph *CreateMat(char a[],int n,int e) { MatGraph G=(MatGraph)malloc(sizeof(MatGraph)); int i,j,k; MatGraph G; G->n=n; G->e=e; for(i=0;i<n;i++) { G.vexs[i].no=i; G.vexs[i].info=a[i]; } for(i=0;i<n;i++) { for(j=0;j<n;i++) { G.edges[i][j]=0; } } for(k=0;k<e;k++) { printf("输入相邻的顶点："); scanf("%d",&i); G.edges[i][j]=1; G.edges[j][i]=1; } return G; } int main(){ int n=7,e=12; char a[]={'0','1','2','3','4','5','6'}; MatGraph *G=CreateMat(a,n,e); AdjGraph *H; CreateAdj(H,G->edges,n,e); return 0; }修改上述代码

修改后的代码如下：

#include <stdio.h> 
#include <stdlib.h> 
#include <string.h> 
#include <malloc.h> 

#define MAXV 1000 
#define ElemType int 
#define INF 32767

typedef struct { 
    int no; 
    int info; 
} VertexType; 

typedef struct{
    int edges[MAXV][MAXV]; 
    int n,e; 
    VertexType vexs[MAXV]; 
} MatGraph; 

typedef struct ArcNode{ 
    int adjvex; 
    int weight; 
    struct ArcNode *nextarc; 
} ArcNode; 

typedef struct VNode{ 
    VertexType data; 
    ArcNode *firstarc; 
} VNode, AdjList[MAXV]; 

typedef struct{ 
    AdjList adjlist; 
    int n,e; 
} AdjGraph; 

void CreateAdj(AdjGraph *&G, int A[MAXV][MAXV], int n, int e){ 
    int i,j; 
    ArcNode *p; 
    G = (AdjGraph *)malloc(sizeof(AdjGraph)); 
    for(i=0; i<n; i++) { 
        G->adjlist[i].firstarc=NULL; 
    } 
    for(i=0; i<n; i++) { 
        for(j=n-1; j>=0; j--) { 
            if(A[i][j]!=0 && A[i][j]!=INF) { 
                p=(ArcNode *)malloc(sizeof(ArcNode)); 
                p->adjvex=j; 
                p->weight=A[i][j]; 
                p->nextarc=G->adjlist[i].firstarc; 
                G->adjlist[i].firstarc=p; 
            } 
        } 
    } 
    G->n=n; 
    G->e=e; 
} 

MatGraph *CreateMat(char a[], int n, int e) { 
    MatGraph *G = (MatGraph *)malloc(sizeof(MatGraph)); 
    int i,j,k; 
    G->n = n; 
    G->e = e; 
    for(i=0; i<n; i++) { 
        G->vexs[i].no=i; 
        G->vexs[i].info=a[i]; 
    } 
    for(i=0; i<n; i++) { 
        for(j=0; j<n; j++) { 
            G->edges[i][j]=0; 
        } 
    } 
    for(k=0; k<e; k++) { 
        printf("输入相邻的顶点："); 
        scanf("%d %d", &i, &j); 
        G->edges[i][j]=1; 
        G->edges[j][i]=1; 
    } 
    return G; 
} 

int main(){ 
    int n=7,e=12; 
    char a[]={'0','1','2','3','4','5','6'}; 
    MatGraph *G = CreateMat(a, n, e); 
    AdjGraph *H; 
    CreateAdj(H, G->edges, n, e); 
    return 0; 
}

主要修改如下：

1. 在函数声明中，将 `MatGraph` 改为指针类型 `MatGraph *`。

2. 在 `CreateMat` 函数中，将 `MatGraph G` 修改为 `MatGraph *G`，并在函数末尾返回 `G` 指针。

3. 在 `CreateAdj` 函数中，将 `G=(AdjGraph *)malloc(sizeof(AdjGraph));` 修改为 `G = (AdjGraph *)malloc(sizeof(AdjGraph));`，并在函数末尾返回 `G` 指针。

4. 在调用函数时，将 `H` 和 `G->edges` 的顺序颠倒。