课上老师安排写的作业,题目如下:
1、若无向图G用邻接表存储,编写函数求得指定 顶点的度;
2、若有向图G用邻接矩阵存储,编写函数求得指 定顶点的入度和出度;
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
#define MAX_VERTEX_NUM 100
#define INFINITY 65535
#define ok 1
#define INFINITY 65535
#define ok 1
typedef int Status;
typedef enum { DG, DN, UDG, UDN } GraphKind;
typedef char VertexType;
typedef int EdgeType;
typedef enum { DG, DN, UDG, UDN } GraphKind;
typedef char VertexType;
typedef int EdgeType;
//邻接表储存结构的无向图求度
typedef struct ArcNode{
int adjvex;
struct ArcNode *nextarc;
EdgeType info;
}ArcNode;
typedef struct VNode{
VertexType data;
ArcNode *firstarc;
}VNode;
typedef struct{
VNode vertices[MAX_VERTEX_NUM];
int vexnum, arcnum;
int kind;
}ALGraph;
VNode vertices[MAX_VERTEX_NUM];
int vexnum, arcnum;
int kind;
}ALGraph;
void CreateALGraph(ALGraph &G){
int i, j, k;
ArcNode *e;
printf("请输入无向图的顶点数和边数:");
scanf("%d%d", &G.vexnum, &G.arcnum);
fflush(stdin);
for (i = 0; i<G.vexnum; i++){
printf("请输入第%d顶点的数据:",i+1);
scanf("%c", &G.vertices[i].data);
G.vertices[i].firstarc = NULL;
fflush(stdin);
}
for (k = 0; k< G.arcnum; k++){
printf("请输入两个顶点之间的路径(Vi,Vj):");
scanf("%d%d", &i, &j);
e=(ArcNode *)malloc(sizeof(ArcNode));
e->adjvex = j;
e->nextarc = G.vertices[i].firstarc;
G.vertices[i].firstarc = e;
e=(ArcNode *)malloc(sizeof(ArcNode));
e->adjvex = i;
e->nextarc = G.vertices[j].firstarc;
G.vertices[j].firstarc = e;
}
}
int i, j, k;
ArcNode *e;
printf("请输入无向图的顶点数和边数:");
scanf("%d%d", &G.vexnum, &G.arcnum);
fflush(stdin);
for (i = 0; i<G.vexnum; i++){
printf("请输入第%d顶点的数据:",i+1);
scanf("%c", &G.vertices[i].data);
G.vertices[i].firstarc = NULL;
fflush(stdin);
}
for (k = 0; k< G.arcnum; k++){
printf("请输入两个顶点之间的路径(Vi,Vj):");
scanf("%d%d", &i, &j);
e=(ArcNode *)malloc(sizeof(ArcNode));
e->adjvex = j;
e->nextarc = G.vertices[i].firstarc;
G.vertices[i].firstarc = e;
e=(ArcNode *)malloc(sizeof(ArcNode));
e->adjvex = i;
e->nextarc = G.vertices[j].firstarc;
G.vertices[j].firstarc = e;
}
}
Status ALGraphDegree(ALGraph G,int n){
int j=0;
while (G.vertices[n].firstarc){
j++;
G.vertices[n].firstarc = G.vertices[n].firstarc->nextarc;
}
printf("无向图中,该节点的度为%d\n", j);
return ok;
}
int j=0;
while (G.vertices[n].firstarc){
j++;
G.vertices[n].firstarc = G.vertices[n].firstarc->nextarc;
}
printf("无向图中,该节点的度为%d\n", j);
return ok;
}
//邻接矩阵储存结构表示的有向图
typedef struct{
EdgeType arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM];
VertexType vexs[MAX_VERTEX_NUM];
int vexnum;
int arcnum;
GraphKind kind;
}MGraph;
void CreateMGraph(MGraph &G){
int i, j, k, w;
G.kind = UDG;
printf("请输入有向图的顶点数和边数:");
scanf("%d%d", &G.vexnum, &G.arcnum);
fflush(stdin);
for (i = 0; i<G.vexnum; i++){
printf("请输入第%d顶点的数据:",i+1);
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] = 0;
}
}
for (k = 0; k<G.arcnum; k++){
printf("请输入两个顶点之间的路径(Vi,Vj):");
scanf("%d%d", &i, &j);
G.arcs[i][j] = 1;
}
}
Status MGraphInAndOutDegree(MGraph G,int n){
int i=0,j=0,k=0;
for (i = 0; i < G.vexnum; i++)
j+=G.arcs[n][i];
for (i = 0; i < G.vexnum; i++)
k += G.arcs[i][n];
printf("有向图中,该节点的入度为:%d、出度为:%d\n", j, k);
return ok;
}
int i=0,j=0,k=0;
for (i = 0; i < G.vexnum; i++)
j+=G.arcs[n][i];
for (i = 0; i < G.vexnum; i++)
k += G.arcs[i][n];
printf("有向图中,该节点的入度为:%d、出度为:%d\n", j, k);
return ok;
}
void main(){
int n;
ALGraph G1;
MGraph G2;
CreateALGraph(G1);
printf("\n");
CreateMGraph(G2);
printf("\n");
printf("请输入想要查询的节点:");
scanf("%d", &n);
printf("\n");
ALGraphDegree(G1, n-1);
MGraphInAndOutDegree(G2, n-1);
system("pause");
}
如有什么不当之处,还请各位大佬指教!