for (i = 0; i < g->vexnum; i++) { for (j = 0; j < g->vexnum; j++) { g->arcs[i][j] = MaxInt; } } printf("Enter the edge information:\n"); for (i = 0; i < g->arcnum; i++) { int v1, v2, w; printf("Edge %d (v1 v2 weight): ", i); scanf("%d %d %d", &v1, &v2, &w); g->arcs[v1][v2] = w; }这段C语言代码怎么改

数据结构-c语言-带main函数-图7.2-图的存储结构-图的邻接矩阵的创建-无向图。

G->arcs[i][j]=0; } } printf("图的初始化成功\n"); } //查找并返回顶点的位置 int LocateVex(Graph* G,VertType v) { int i; for(i=0; i<G->vexnum; i++){ if(G->vexs[i] == v) return i; } return -1; /...

计本2206.docx

i < G->vexnum; i++) { printf("请依次输入顶点的值\n"); scanf("%d", &G->vexs[i]); } for (int i = 0; i < G->vexnum; i++) { for (int j = 0; j < G->vexnum; j++) { G->arcs[i][j] = Maxlnt; } } for ...

#include<iostream> using namespace std; typedef struct{ char* vexs; int** arcs; int vexNum; int arcNum; }Graph; Graph* initGraph(int vexNum) { Graph* G = new Graph; G->arcs = new int;G->vexs = new char; for(int i = 0;i<vexNum;i++) G->arcs[i] = new int; G->arcNum = 0; G->vexNum = vexNum; return G; } void createGraph(Graph G,char* vexs,int* arcs) { for(int i = 0;i<G->vexNum;i++) { G->vexs[i] = vexs[i]; for(int j = 0;j<G->vexNum;j++) { G->arcs[i][j] = (arcs+iG->vexNum+j); if(G->arcs[i][j]) G->arcNum++; } } G->arcNum=2;//无向图 } void dfs(Graph* G,int* visited,int index) { cout<<G->vexs[index]<<'\t'; visited[index] = 1; for(int i = 0;i<G->vexNum;i++) { if(!visited[i] && G->arcs[index][i]) dfs(G,visited,i); } } void test1() { Graph* G = initGraph(5); char vexs[6] = "ABCDE"; int arcs[5][5] = { 0,1,1,1,0, 1,0,1,1,1, 1,1,0,0,0, 1,1,0,0,1, 0,1,0,1,0 }; createGraph(G,vexs,(int*)arcs); int visited[6] = {0}; dfs(G,visited,0); } int main() { test1(); return 0; }

G->arcs[i][j] = *(arcs + i * G->vexNum + j); if (G->arcs[i][j]) G->arcNum++; } } G->arcNum /= 2; // 无向图，边数需要除以2 } void dfs(Graph* G, int* visited, int index) { cout << G->vexs[index]...

void Kruskal(Graph* g) { int i, j, k = 0; struct { ElementType head; ElementType tail; EdgeType cost; }edge[MaxVexNum],t; int vexSet[MaxVexNum]; for (i = 0; i < g->vexNum; i++) { //遍历矩阵的下三角元素 for (j = 0; j < i; j++) { if (g->edge[i][j] != INFINITY) { edge[k].head = i; edge[k].tail = j; edge[k++].cost = g->edge[i][j]; } } } for (i = 0; i < g->vexNum; i++) vexSet[i] = i; //各个顶点自成一个连通分量 for (i = 0; i < g->edgeNum-1; i++) { for (j = g->edgeNum-1; j >= i + 1; j--) { if (edge[j].cost < edge[j - 1].cost) { t = edge[j-1]; edge[j-1] = edge[j]; edge[j] = t; } } } for (i = 0; i < g->edgeNum; i++) { int vs1, vs2; vs1 = vexSet[edge[i].head]; vs2 = vexSet[edge[i].tail]; if (vs1 != vs2) { printf("(%c,%c)", g->vex[edge[i].tail], g->vex[edge[i].head]); for (j = 0; j < g->edgeNum; j++) { if (vexSet[j] == vs2) vexSet[j] = vs1; } } } }

这是一个基于Kruskal算法实现的最小生成树算法。其思路是先将图中的所有边按照权值排序，然后从小到大依次加入边，如果加入的边不会形成环，则将其加入最小生成树中，否则舍弃该边。具体实现过程如下： ...

void MiniSpanTree_Prim(AMGraph* G, int u) { int k = 0; k = LocateVex(G, u); for (int j = 0; j < G->vexnum; j++) { if (j != k) closedge[j] = { u,G->arcs[k][j] }; } closedge[k].lowcost = 0; for (int i = 0; i < G->vexnum; i++) { k = Min(closedge); int u0 = closedge[k].adjvex; int v0 = G->vexs[k]; printf("%d %d", u0, v0); closedge[k].lowcost = 0; for (int j = 0; j < G->vexnum; j++) { if (G->arcs[i][j] < closedge[j].lowcost) { closedge[i] = { G->vexs[k],G->arcs[i][j] }; } } } }

以下是将该段代码转换为C语言的代码： c void MiniSpanTree_Prim... if (G->arcs[i][j] < closedge[j].lowcost) { closedge[j].adjvex = G->vexs[k]; closedge[j].lowcost = G->arcs[i][j]; } } } }

int LocateVex(AMGraph G,VerTexType v) { int i; for (i = 0; i < G->vexnum; i++) { if (G->vex[i] == v) return i; } return -1; } Status CreateUDN(AMGraph G) { int i, j, k; VerTexType v1, v2; ArcType w; printf("输入城市的总数量和总边数："); scanf("%d %d", &G->vexnum, &G->arcnum); fflush(stdin); printf("输入各个城市的代号："); for (i = 0; i < G->vexnum; i++) scanf("%c", &G->vex[i]); for (i = 0; i < G->vexnum;i++) for (j = 0; j < G->vexnum; j++) { G->arc[i][j] = Max_Int; } for (k = 0; k < G->arcnum; k++) { fflush(stdin); printf("输入相邻城市以及它们之间的成本："); scanf("%c %c %d", &v1, &v2, &w); i = LocateVex(G, v1); j = LocateVex(G, v2); G->arc[i][j] = w; G->arc[j][i] = G->arc[i][j]; } return OK; } //查找下一个权值最小的边上的另一个节点 int Min(AMGraph G) { int i; int min = Max_Int; int index = -1; for (i = 0; i < G.vexnum; i++) { if (min>closedge[i].lowcost&&closedge[i].lowcost!=0) { min = closedge[i].lowcost; index = i; } } return index; }

这段代码是 Prim 算法实现中用到的一些函数。其中，LocateVex 函数用来查找顶点 v 在邻接矩阵中的位置，CreateUDN 函数用来创建无向图，包括输入城市的总数量和总边数，各个城市的代号以及相邻城市之间的成本。...

优化这段代码#define _CRT_SECURE_NO_WARNINGS #pragma warning(disable:4996) #include<stdio.h> #include<stdlib.h> #define MAX_VERTEX_NUM 20// 邻接矩阵无向图结构体 #define inf 32768 typedef char VertexData; typedef struct { char vertex[MAX_VERTEX_NUM]; // 顶点表 int arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; // 邻接矩阵 int vexnum, arcnum; // 顶点数 } AdjMatrix;// 初始化无向图 int LocateVertes(AdjMatrix* G, char v) //顶点位置 { int j = 0, k; for (k = 0; k < G->vexnum; k++) if (G->vertex[k] == v) { j = k; break; } return j; } void CreateUDG(AdjMatrix* G) //无向图 { int i; int j; int k; char v1, v2; scanf("%d,%d", &G->vexnum, &G->arcnum); getchar(); for (i = 0; i < G->vexnum; i++) for (j = 0; j < G->vexnum; j++) G->arcs[i][j] = 0; for (i = 0; i < G->vexnum; i++) scanf("%c", &G->vertex[i]); getchar(); for (k = 0; k < G->arcnum; k++) { scanf("%c,%c", &v1, &v2); getchar(); i = LocateVertes(G, v1); i = LocateVertes(G, v2); G->arcs[i][j] = 1; } for (i = 0; i < G->vexnum; i++) { for (j = 0; j < G->vexnum; j++) printf("%d", G->arcs[i][j]); printf("\n"); } } int main() { AdjMatrix G; CreateUDG(&G); return 0; }

i < G->vexnum; i++) { if (G->vertex[i] == v) { return i; } } return -1; } // 初始化无向图 void createUDG(AdjMatrix* G) { int i; int j; int k; char vertex1, vertex2; scanf("%d,%d", &G->...

#include<stdio.h> #include<stdbool.h> #define MAX_VERTEX_NUM 50 typedef struct{ int vertex[MAX_VERTEX_NUM]; int arc[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; int vexnum; }MGraph; void InitMGraph(MGraphG) { int i,j; for(i=0;i<G->vexnum;i++) { for(j=0;j<G->vexnum;j++) { G->arc[i][j]=0; } } } void DFS(MGraph G,bool visited,int v) { int w; visited[v]=true; printf("%d ",G.vertex[v]); for(w=0;w<G.vexnum ;w++) { if(G.arc[v][w]!=0&&!visited[w]) { DFS(G,visited,w); } } } void DFSTraverse(MGraph G) { int v; bool visited[MAX_VERTEX_NUM]; for(v=0;v<G.vexnum;v++) { visited[v]=false; } for(v=0;v<G.vexnum;v++) { if(!visited[v]) { DFS(G,visited,v); } } } int FirstAdjVex(MGraph G,int v)//查找第一个临界点 { int w; for(w=0;w<G.vexnum;w++) { if(G.arc[v][w]!=0) return w; } return -1; } int NextAdjVex(MGraph G,int v,int w)//查找下一个临界点 { int i; for(i=w+1;i<G.vexnum;i++) { if(G.arc[v][i]!=0) { return i; } } return -1; } int main() { MGraph G; int i,j; scanf("%d",&G.vexnum); for(i=0;i<G.vexnum;i++) { scanf("%d",&G.vertex[i]); } InitMGraph(&G); for(i=0;i<G.vexnum;i++) { for(j=0;j<G.vexnum;j++) { scanf("%d",&G.arc[i][j]); } } DFSTraverse(G); printf("\n"); return 0; } 应如何修改才能让其能够输入4 0 1 0 1 1 0 0 0 0 0 0 1 1 0 1 0 矩阵，输出0 1 3 2

i<G.vexnum;i++) { scanf("%d",&G.vertex[i]); for(j=0;j<G.vexnum;j++) { scanf("%d",&G.arc[i][j]); } } 这样就可以同时输入顶点和邻接矩阵了。同时，应该将 DFS 函数中的 printf("%d ",G.vertex[v]) 改...

#include<stdio.h> #include<stdlib.h> Typedef struct Graph{ Char* vexs; Int** arcs; Int vexnum,arcnum; )Graph; Graph* initGraph(int vexnum){ Graph* G=(Graph)malloc(sizeof(Graph)) G->vexs=(char)malloc(sizeof (char)*vexnum) G->arcs=(int**)malloc(sizeof (int)vexnum) For(int i=0;i<vexnum;I++) { G->arcs[i]= (int)malloc(sizeof (int)vexnum)} G->vexnum=Vexnum; G->arcnum=0; Return G } Int createGraph(Graph* G,char* vexs,int* arcs) {for(i=0;i<G->vexnum;i++) G->vexs[i]=vexs[i]; For((j=0;j<G->vexnum;j++) G->arcs[i][j]=(arcs+ivexnum+j ) If(G->arcs[i][j]!=0) G->arcnum++; } G->arcnum/=2; } Void DFS(Graph* G,int visit,int index){ Printf("%c",G->vexs[index]) Visit[index]=1; For(int i=0;i<G->vexnum;i++) If(G->arcs[index][i]==1&&visit[index]!=1) DFS(G,visit,i) } Void BFS(Graph G,int visit ,int index){ Printf("%c",&G->vexs[index]) Visit[index]=1; Queue initQueue(); enQueue(Q,index); while(!isEmpty(Q)) int i=deQueue(); For(int j=0;j<G->vexnum;J++) If(G->arcs[i][j]==1&&!visit[j]) Printf("%c",G->vexs[j]) Visit[j]=1; enQueue(Q,j);} } #define MAXSIZE 5 Typedef struct Queue{ Int front Int rear Int data[MAXSIZE] }Queue; Queue* Q InitQueue() { Queue* Q=(Queue)malloc(sizeof(QUeue)); Queue->front=Queue->rear=0; Return Q; } Int enQueue(Queue Q, int data) If (isFull(Q)){ Return 0} Else Q->data[Q->rear]=data; Q->rear=(Q->rear+1)%MAXSIZE } Int deQueue(Queue* Q) If (isempty(Q)){ Return 0} Else Int data=Q->data[Q->front]; Q->front=(Q->front+1)%MAXSIZE Return data; } Void printfQueue(Queue* Q){ Int length=(Q->rea-Q->front+MAXSIZE)%MAXSIZE For(int i=0;i<length;i++) Printf("%d->",Q->data[Q->front]) Q->front=(Q->front+1)%MAXSIZE; Int main(){ Graph* G=initGraph(5); Int arcs[5][5]={ 0,1,1,1,0, 0,1,1,1,0, 0,1,1,1,0, 0,1,1,1,0, 0,1,1,1,0, }; CreateGraph(G,"ABCDE",(int)arcs); Int* visit=(int)malloc(sizeof(int)G->vexnum); For(int i=0;i<G->vexnum;i++) Visit[i]=0; DFS(G,visit,0); BFS(G,visit,0) }修改正确并转化为c语言代码

G->arcs[i][j] = *(arcs + i * G->vexnum + j); if(G->arcs[i][j] != 0) { G->arcnum++; } } } G->arcnum /= 2; } typedef struct Queue{ int front; int rear; int data[MAXSIZE]; }Queue; Queue* ...

#include<stdio.h> #include<stdbool.h> #define MAX_VERTEX_NUM 50 typedef struct{ int vertex[MAX_VERTEX_NUM]; int arc[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; int vexnum; }MGraph; void InitMGraph(MGraphG) { int i,j; for(i=0;i<G->vexnum;i++) { for(j=0;j<G->vexnum;j++) { G->arc[i][j]=0; } } } void DFS(MGraph G,bool visited,int v) { int w; visited[v]=true; printf("%d ",v); for(w=0;w<G.vexnum ;w++) { if(G.arc[v][w]!=0&&!visited[w]) { DFS(G,visited,w); } } } void DFSTraverse(MGraph G) { int v; bool visited[MAX_VERTEX_NUM]; for(v=0;v<G.vexnum;v++) { visited[v]=false; } for(v=0;v<G.vexnum;v++) { if(!visited[v]) { DFS(G,visited,v); } } } int FirstAdjVex(MGraph G,int v)//查找第一个临界点 { int w; for(w=0;w<G.vexnum;w++) { if(G.arc[v][w]!=0) return w; } return -1; } int NextAdjVex(MGraph G,int v,int w)//查找下一个临界点 { int i; for(i=w+1;i<G.vexnum;i++) { if(G.arc[v][i]!=0) { return i; } } return -1; } int main() { MGraph G; int i,j; scanf("%d",&G.vexnum); for(i=0;i<G.vexnum;i++) { scanf("%d",&G.vertex[i]); } InitMGraph(&G); for(i=0;i<G.vexnum;i++) { scanf("%d",&G.vertex[i]); for(j=0;j<G.vexnum;j++) { scanf("%d",&G.arc[i][j]); } } DFSTraverse(G); printf("\n"); return 0; } 代码应如何修改才能保证输入4 0 1 0 1 1 0 0 0 0 0 0 1 1 0 1 0矩阵，输出结果是0 1 3 2修改后的代码是什么

i<=G->vexnum;i++) { for(j=0;j<=G->vexnum;j++) { G->arc[i][j]=0; } } } void DFS(MGraph G,bool *visited,int v) { int w; visited[v]=true; printf("%d ",v); for(w=0;w<G.vexnum ;w++) { if(G.arc[v]...

#include <stdio.h> #include <stdlib.h> #define INFINITY 32768 #define MaxVexNum 20 typedef char ElemType; typedef enum {DG, DN, UDG, UDN} GraphKind; typedef struct { ElemType vexs[MaxVexNum]; int arcs[MaxVexNum][MaxVexNum]; int vexnum, arcnum; } AMGraph; int locate(AMGraph G, char v) { int k; for (k = 0; k < G.vexnum; k++) { if (G.vexs[k] == v) { return k; } } return -1; } void CreatMGraph(AMGraph G) { int i, j, k; char v1, v2; scanf("%d%d", &G->vexnum, &G->arcnum); getchar(); for (i = 0; i < G->vexnum; i++) { for (j = 0; j < G->vexnum; j++) { G->arcs[i][j] = 0; } } for (i = 0; i < G->vexnum; i++) { scanf(" %c", &G->vexs[i]); } getchar(); for (k = 0; k < G->arcnum; k++) { scanf("%c%c", &v1, &v2); getchar(); i = locate(G, v1); j = locate(*G, v2); G->arcs[i][j] = 1; G->arcs[j][i] = 1; } } int visited[MaxVexNum]; void DepthFirstSearch(AMGraph g, int v0) { visited[v0] = 1; printf("%c", g.vexs[v0]); for (int vj = 0; vj < g.vexnum; vj++) { if (!visited[vj] && g.arcs[v0][vj] == 1) { DepthFirstSearch(g, vj); } } } void TraverseGraph(AMGraph g) { for (int vi = 0; vi < g.vexnum; vi++) { visited[vi] = 0; } for (int vi = 0; vi < g.vexnum; vi++) { if (!visited[vi]) { DepthFirstSearch(g, vi); } } } int main() { AMGraph G; CreatMGraph(&G); TraverseGraph(G); printf("\n%d",G.vexnum-1); return 0; }找连通分量

G->arcs[i][j] = 0; } } for (i = 0; i < G->vexnum; i++) { scanf(" %c", &G->vexs[i]); } getchar(); for (k = 0; k < G->arcnum; k++) { scanf("%c%c", &v1, &v2); getchar(); i = locate(*G, v1); j...

#include <stdio.h> #include <stdlib.h> #define INFINITY 32768 #define MaxVexNum 20 typedef int ElemType; typedef enum {DG, DN, UDG, UDN} GraphKind; typedef struct { ElemType vexs[1000]; int arcs[1000][1000]; int vexnum, arcnum; } AMGraph; int locate(AMGraph G, char v) { int k; for (k = 0; k < G.vexnum; k++) { if (G.vexs[k] == v) { return k; } } return -1; } void CreatMGraph(AMGraph G) { int i, j, k; int v1, v2; scanf("%d%d", &G->vexnum, &G->arcnum); getchar(); for (i = 0; i < G->vexnum; i++) { for (j = 0; j < G->vexnum; j++) { G->arcs[i][j] = 0; } } for(i=0;i<G->vexnum;i++) { G->vexs[i]=i+1; } for (k = 0; k < G->arcnum; k++) { scanf("%d%d", &v1, &v2); getchar(); i = locate(G, v1); j = locate(*G, v2); G->arcs[i][j] = 1; G->arcs[j][i] = 1; } } int visited[MaxVexNum]; void DepthFirstSearch(AMGraph g, int v0) { visited[v0] = 1; for (int vj = 0; vj < g.vexnum; vj++) { if (!visited[vj] && g.arcs[v0][vj] == 1) { DepthFirstSearch(g, vj); } } } void TraverseGraph(AMGraph g,int v0) { for (int vi = 0; vi < g.vexnum; vi++) { visited[vi] = 0; } DepthFirstSearch(g, v0); } int main() { int v0,v1; AMGraph G; CreatMGraph(&G); scanf("%d%d",&v0,&v1); TraverseGraph(G,v0); if(visited[v1]==1) printf("yes"); else printf("no"); return 0; }修改

G->arcs[i][j] = 0; } } for(i=0;i<G->vexnum;i++) { G->vexs[i]=i+1; } for (k = 0; k < G->arcnum; k++) { scanf("%d%d", &v1, &v2); getchar(); i = locate(*G, v1); j = locate(*G, v2); ...

#include <stdio.h> #include <stdlib.h> #define MAX_VERTEX_NUM 20 #define INFINITY 65535 #define TRUE 1 #define FALSE 0 #define OK 1 #define FAIL 0 typedef int Status; typedef enum { DG, DN, UDG, UDN } GraphKind; typedef struct ArcCell { int adjvex; int weight; } ArcCell, AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; typedef struct { int vertex[MAX_VERTEX_NUM]; int arc[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; int vexnum, arcnum; GraphKind kind; } MGraph; int LocateVex(MGraph G, int v) { int i; for (i = 0; i < G.vexnum; i++) if (G.vertex[i] == v) return i; return -1; } Status CreateDN(MGraph* G) { int i, j, k, w, v1, v2; ArcCell* p; printf("input the number of vertexes and arcs: "); scanf("%d,%d", &G->vexnum, &G->arcnum); for (i = 0; i < G->vexnum; i++) { printf("input the %dth vertex: ", i); scanf("%d", &G->vertex[i]); } for (i = 0; i < G->vexnum; i++) for (j = 0; j < G->vexnum; j++) G->arc[i][j] = INFINITY; for (k = 0; k < G->arcnum; k++) { printf("input the %dth arc: ", k); scanf("%d,%d,%d", &v1, &v2, &w); i = LocateVex(G, v1); j = LocateVex(G, v2); G->arc[i][j] = w; // G->arc[j][i] = w; } return OK; } void OutputDN(MGraph G) { int i, j; for (i = 0; i < G.vexnum; i++) { printf("%d:", G.vertex[i]); for (j = 0; j < G.vexnum; j++) printf("%5d ", G.arc[i][j]); printf("\n"); } } int main(void) { MGraph G; CreateDN(&G); OutputDN(G); printf("success\n"); return 0; }

这段代码是用 C 语言实现的一个有向图的建立和输出的程序，其中包含了邻接矩阵的定义和相关操作函数，可以用于创建一个带权有向图，并输出其邻接矩阵。具体实现包括创建有向图的函数 CreateDN，输出邻接矩阵的函数 ...

#include <stdio.h> #include <stdlib.h> #define MAX_VERTEX_NUM 50 typedef struct { int data[MAX_VERTEX_NUM]; int front, rear; } Queue; void InitQueue(Queue Q) { Q->front = Q->rear = 0; } int QueueEmpty(Queue Q) { return Q.front == Q.rear; } void EnQueue(Queue Q, int x) { Q->data[Q->rear++] = x; } int DeQueue(Queue Q) { return Q->data[Q->front++]; } typedef struct { int vex[MAX_VERTEX_NUM]; int edge[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; int vexnum, edgenum; } Graph; void CreateGraph(Graph G) { int i, j; scanf("%d", &G->vexnum); for (i = 0; i < G->vexnum; i++) { for (j = 0; j < G->vexnum; j++) { scanf("%d", &G->edge[i][j]); } } } int FirstAdjVex(Graph G, int v) { int i; for (i = 0; i < G.vexnum; i++) { if (G.edge[v][i] == 1) { return i; } } return -1; } int NextAdjVex(Graph G, int v, int w) { int i; for (i = w + 1; i < G.vexnum; i++) { if (G.edge[v][i] == 1) { return i; } } return -1; } void BFS(Graph G, int v, int visited[]) { Queue Q; int w, i; InitQueue(&Q); visited[v] = 1; printf("%d ", v); EnQueue(&Q, v); while (!QueueEmpty(Q)) { w = DeQueue(&Q); for (i = FirstAdjVex(G, w); i != -1; i = NextAdjVex(G, w, i)) { if (!visited[i]) { visited[i] = 1; printf("%d ", i); EnQueue(&Q, i); } } } } void BFSTraverse(Graph G) { int visited[MAX_VERTEX_NUM] = {0}; int i; for (i = 0; i < G.vexnum; i++) { if (!visited[i]) { BFS(G, i, visited); } } } int main() { Graph G; CreateGraph(&G); BFSTraverse(G); printf("\n"); return 0; }上述代码的各个步骤都有什么用

2. 初始化队列操作InitQueue，将队首和队尾指针都初始化为0，表示队列为空。 3. 判断队列是否为空操作QueueEmpty，如果队首指针等于队尾指针，则队列为空。 4. 入队操作EnQueue，将元素x添加到队尾rear指向的位置...

int CreateDG(MGraph* G) { int i,j,k; VertexType v1,v2; int w; printf("请输入构建图的顶点个数和弧的个数\n"); scanf("%d%d",&G->vexnum,&G->arcnum); fflush(stdin); printf("请输入构建图的顶点的向量（字符表示,请连续输入）\n"); for(i=0;i<G->vexnum;++i) scanf("%c",&G->vexs[i]); fflush(stdin); for (i=0;i<G->vexnum;++i) for(j=0;j<G.arcnum;++j) G.arcs[i][j].adj=INFINITY; printf("请依次输入每一条边依附的顶点和权值，每个由空格隔开\n"); for (k=0;k<G.arcnum;++k) { scanf("%c %c%d",&v1,&v2,&w); fflush(stdin); i=LocateVex(G,v1); j=LocateVex(G,v2); G.arcs[i][j].adj=w; } return 1; }修改为C语言代码

i<G->vexnum;++i) scanf("%c",&G->vexs[i]); fflush(stdin); for (i=0;i<G->vexnum;++i) for(j=0;j<G->vexnum;++j) G->arcs[i][j].adj=INFINITY; printf("请依次输入每一条边依附的顶点和权值，每个由空格隔开...

#include<stdio.h> #include<stdlib.h> #include<string.h> #define MAX_VERTEX_NUM 20 struct ArcNode{ int adjvex; ArcNode nextarc; int info; };//表结点 typedef struct{ char data; ArcNode firstarc; }VNode,AdjList[MAX_VERTEX_NUM];//头结点 struct ALGraph{ AdjList vertices; int vexnum; }; void CreateGraph(ALGraph G) {scanf("%d",&G->vexnum); int i; for(i=0;i<G->vexnum;i++) {G->vertices[i].data=getchar(); G->vertices[i].firstarc=NULL; getchar(); } char num[20]; for(i=0;i<G->vexnum;i++) {char token; int con[20];//存分割后的整型数 scanf("%s",num); token=strtok(num," "); int j=0; while(token!=NULL)//分割num，依次存入con {con[j]=atoi(token); j++; token=strtok(NULL," "); } int k=0; ArcNode q; q=NULL; G->vertices[i].firstarc->nextarc=NULL; for(k=0;k<j;k++) {if(k%2==0) {q=(ArcNode)malloc(sizeof(ArcNode));//?可能有问题 q->adjvex=con[k]; q->nextarc=G->vertices[i].firstarc; G->vertices[i].firstarc=q; } else {q->info=(int)malloc(sizeof(int)); (q->info)=con[k]; } } } } int main() {ALGraph G0; CreateGraph(G0); int i; for(i=0;i<G0->vexnum;i++) {printf("%c ",G0->vertices[i].data); ArcNode p; p=G0->vertices[i].firstarc; while(p) {printf("(%d,%d)%d ",i,p->adjvex,(p->info)); p=p->nextarc; } } return 0; }

k < j; k += 2) { q = (ArcNode*)malloc(sizeof(ArcNode)); q->adjvex = con[k]; q->nextarc = G->vertices[i].firstarc; G->vertices[i].firstarc = q; q->info = (int*)malloc(sizeof(int)); *(q->info) = ...

详细解释一下这段代码 int LocateVertex(AdjList* G, VertexData v) { int k; for (k = 0; k < G->vexnum; k++) { if (G->vertex[k].data == v) break; } return k; } int CreateAdjList(AdjList* G) { int i, j, k; VertexData v1, v2; ArcNode* p; printf("输入图的顶点数和弧数："); scanf("%d%d", &G->vexnum, &G->arcnum); printf("输入图的顶点："); for (i = 0; i < G->vexnum; i++) { G->vertex[i].firstarc = NULL; } for (k = 0; k < G->arcnum; k++) { printf("输入第%d条弧的两个顶点：", k + 1); scanf(" %c %c", &v1, &v2); i = LocateVertex(G, v1); j = LocateVertex(G, v2); p = (ArcNode*)malloc(sizeof(ArcNode)); p->adjvex = j; p->nextarc = G->vertex[i].firstarc; G->vertex[i].firstarc = p; } }

首先，它会提示用户输入图的顶点数和弧数，并将输入的值保存到G的成员变量vexnum和arcnum中。然后，它会提示用户输入图的每个顶点，并将每个顶点的firstarc指针初始化为NULL。接下来，它会循环读取用户输入的弧的...

printf("Output the message of VNode:\n"); for(i=0;i<G->vexnum;++i) printf("v%d\n",G->vertices[i].data); for(k=0;k<G->arcnum;++k) { printf("Please input the %d edge beginpoint and endpoint: ",k+1); scanf("%d%d",&v1,&v2); i=LocateVex(G,v1); j=LocateVex(G,v2); if(i>=0&&j>=0) { ++flag; p=(ArcNode )malloc(sizeof(ArcNode)); p->adjvex=_; p->nextarc=NULL; if(!G->vertices[i].firstarc) G->vertices[i].firstarc=p; else { for(p1=G->vertices[i].firstarc;p1->nextarc;p1=p1->nextarc); ________; } q=(ArcNode )malloc(sizeof(ArcNode)); q->adjvex=i; q->nextarc=NULL; if(!G->vertices[j].firstarc) G->vertices[j].firstarc=q; else { for(q1=G->vertices[j].firstarc;q1->nextarc;q1=q1->nextarc); q1->nextarc=q; } } else { printf("Not hava this edge!\n"); k=flag; } }

在这段代码中，第一个空的位置应该填写的是 j，即： p->adjvex = j; 而第二个空的位置应该填写的是： p1->nextarc = p;

请帮我修改代码，使其能正常运行int File(G g){ int i,j; FILE fp=fopen("C:\\Users\\bai10\\Documents\\map.txt","r"); if(fp==NULL) { printf("无法打开文件\n"); exit(0); } else { while(!feof(fp)) { for(i=0;i<g->vexnum;i++) { for(j=0;j<g->vexnum;j++) { fscanf(fp,"%d",&(g->arcs[i][j])); } } } fclose(fp); return 0; } } int main(){ G g; File(&g); return 0; }

i<g->vexnum;i++){ for(j=0;j<g->vexnum;j++){ fscanf(fp,"%d",&(g->arcs[i][j])); } } } fclose(fp); // 关闭文件指针 return 0; } } int main(){ G g; memset(&g, 0, sizeof(G)); // 初始化...

相关推荐

数据结构-c语言-带main函数-图7.2-图的存储结构-图的邻接矩阵的创建-无向图。

计本2206.docx

最新推荐

若依管理存在任何文件读取漏洞检测系统，渗透测试.zip

【java毕业设计】学生社团管理系统源码（完整前后端+说明文档+LW）.zip

【java毕业设计】音乐+商城的设计与实现源码（完整前后端+说明文档+LW）.zip

基于JAVA+SpringBoot+MySQL的网上图书商城设计与实现.docx

【java毕业设计】百色学院创新实践学分认定系统源码（ssm+mysql+说明文档+LW）.zip

C语言数组操作：高度检查器编程实践

管理建模和仿真的文件

【KUKA系统变量进阶】：揭秘从理论到实践的5大关键技巧

如何使用Python编程语言创建一个具有动态爱心图案作为背景并添加文字'天天开心（高级版）'的图形界面？

基于Swift开发的嘉定单车LBS iOS应用项目解析