优化这段代码#include<stdio.h> #include<stdlib.h> #define Maxsize 10 int visited[Maxsize]={0}; typedef char DataType; typedef struct { DataType vertex[Maxsize]; int edge[Maxsize][Maxsize]; int vertexNum,edgeNum; }MGraph; void CreatGraph(MGraph*G,DataType a[],int n,int e) { int i,j,k; G->vertexNum=n; G->edgeNum=e; for(i=0;i<G->vertexNum;i++) { G->vertex[i]=a[i]; } for(i=0;i<G->vertexNum;i++) { for(j=0;j<G->vertexNum;j++) { G->edge[i][j]=0; } } printf("输入边的位置："); for(k=0;k<=G->edgeNum;k++) { scanf("%d%d",&i,&j); getchar(); G->edge[i][j]=1; G->edge[j][i]=1; } } void DFSTraverse(MGraph*G,int v) { printf("%c",G->vertex[v]); visited[v]=1; for(int j=0;j<=G->vertexNum;j++) { if(G->edge[v][j]==1&&visited[j]==0) DFSTraverse(G,j); } } void BFSTraverse(MGraph*G,int v) { printf("%c",G->vertex[v]); visited[v]=1; for(int j=0;j<=G->vertexNum;j++) { if(G->edge[j][v]==1&&visited[v]==0) DFSTraverse(G,j); } } void BFSTraverseclear(MGraph*G) { int i; for(i=1; i<G->vertexNum; i++) { visited[i]=0; } } int main() { MGraph MG; int i,t,h; printf("输入顶点数"); scanf("%d",&t); printf("输入边数"); scanf("%d",&h); char ch[t]; printf("输入顶点值"); for(i=0;i<t;i++) { scanf("%c",&ch[i]); } CreatGraph(&MG,ch,t,h); for(i=0;i<t;i++) visited[i]=0; printf("深度遍历"); DFSTraverse(&MG,0); printf("\n广度遍历"); BFSTraverseclear(&MG); BFSTraverse(&MG,0); return 0; }

首先，可以将一些重复的代码进行封装，例如将深度优先遍历和广度优先遍历中的 visited 数组清零的操作封装成一个函数。同时，在输入边的位置时，可以使用循环而非递归，避免重复代码。

下面是优化后的代码：

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

#define Maxsize 10

typedef char DataType;

typedef struct {
    DataType vertex[Maxsize];
    int edge[Maxsize][Maxsize];
    int vertexNum, edgeNum;
} MGraph;

int visited[Maxsize] = {0};

void CreatGraph(MGraph *G, DataType a[], int n, int e) {
    int i, j, k;
    G->vertexNum = n;
    G->edgeNum = e;
    for (i = 0; i < G->vertexNum; i++) {
        G->vertex[i] = a[i];
    }
    for (i = 0; i < G->vertexNum; i++) {
        for (j = 0; j < G->vertexNum; j++) {
            G->edge[i][j] = 0;
        }
    }
    printf("输入边的位置：");
    for (k = 0; k < G->edgeNum; k++) {
        scanf("%d%d", &i, &j);
        getchar();
        G->edge[i][j] = 1;
        G->edge[j][i] = 1;
    }
}

void TraverseClear(MGraph *G) {
    int i;
    for (i = 0; i < G->vertexNum; i++) {
        visited[i] = 0;
    }
}

void DFS(MGraph *G, int v) {
    printf("%c", G->vertex[v]);
    visited[v] = 1;
    for (int j = 0; j < G->vertexNum; j++) {
        if (G->edge[v][j] == 1 && visited[j] == 0) {
            DFS(G, j);
        }
    }
}

void DFSTraverse(MGraph *G, int v) {
    TraverseClear(G);
    DFS(G, v);
}

void BFS(MGraph *G, int v) {
    int queue[Maxsize], front = 0, rear = 0;
    printf("%c", G->vertex[v]);
    visited[v] = 1;
    queue[rear++] = v;
    while (front != rear) {
        int w = queue[front++];
        for (int j = 0; j < G->vertexNum; j++) {
            if (G->edge[w][j] == 1 && visited[j] == 0) {
                printf("%c", G->vertex[j]);
                visited[j] = 1;
                queue[rear++] = j;
            }
        }
    }
}

void BFSTraverse(MGraph *G, int v) {
    TraverseClear(G);
    BFS(G, v);
}

int main() {
    MGraph MG;
    int t, h;
    printf("输入顶点数：");
    scanf("%d", &t);
    printf("输入边数：");
    scanf("%d", &h);
    char ch[t];
    printf("输入顶点值：");
    for (int i = 0; i < t; i++) {
        scanf(" %c", &ch[i]);
    }
    CreatGraph(&MG, ch, t, h);
    printf("深度遍历：");
    DFSTraverse(&MG, 0);
    printf("\n广度遍历：");
    BFSTraverse(&MG, 0);
    return 0;
}