数组表示法:
使用数组存储图时,需要使用两个数组,一个数组存放图中顶点本身的数据(一维数组),另外一个数组用于存储各顶点之间的关系(二维数组)。
1.构造有向图:
//构造有向图
#include <stdio.h>
#include <stdlib.h>
#define MAX_VERtEX_NUM 20 //顶点的最大个数
#define VRType int //表示顶点之间的关系的变量类型
#define InfoType char //存储弧或者边额外信息的指针变量类型
#define VertexType int //图中顶点的数据类型
typedef struct {
VRType adj;
InfoType * info;
} AdjMatrix[MAX_VERtEX_NUM][MAX_VERtEX_NUM];
typedef struct {
VertexType vexs[MAX_VERtEX_NUM];
AdjMatrix arcs;
int vexnum, arcnum;
}MGraph;
int LocateVex(MGraph * G, VertexType v) {
int i = 0;
for (; i<G->vexnum; i++) {
if (G->vexs[i] == v) {//遍历数组找到数据V
break;
}
}
if (i>G->vexnum) {
printf("no such vertex.\n");
return -1;
}
return i;
}
void CreateDG(MGraph *G) {
printf("输入图含有的顶点数:");
scanf_s("%d", &(G->vexnum));
printf("弧的个数:");
scanf_s("%d", &(G->arcnum));
//使用一位数组存储数据
printf("依次输入顶点本身的数据:");
for (int i = 0; i<G->vexnum; i++) {
scanf_s("%d", &(G->vexs[i]));
}
//由于安全问题对数据初始化
for (int i = 0; i<G->vexnum; i++) {
for (int j = 0; j<G->vexnum; j++) {
G->arcs[i][j].adj = 0;
G->arcs[i][j].info = NULL;
}
}
printf("在二维数组中添加弧的数据:\n");
for (int i = 0; i<G->arcnum; i++) {
int v1, v2;
printf("V1的值:");
scanf_s("%d", &v1);
printf("V2的值:");
scanf_s("%d", &v2);
int n = LocateVex(G, v1);
int m = LocateVex(G, v2);
if (m == -1 || n == -1) {
printf("no this vertex\n");
return ;
}
//有的话就在矩阵里标记1
G->arcs[n][m].adj = 1;
printf("输入成功!!!\n");
}
}
void PrintGrapth(MGraph G)
{
printf("开始打印\n");
printf(" ");
for (int i = 0; i < G.vexnum; i++)
{
printf("%d\t",i);
}
for (int i = 0; i < G.vexnum; i++)
{
printf("%d ", i);
for (int j = 0; j < G.vexnum; j++)
{
printf("%d\t", G.arcs[i][j].adj);
}
//getchar();
printf("\n");
}
return ;
}
int main() {
system("title");
MGraph G;
CreateDG(&G);
PrintGrapth(G);
system("pause");
}
answer:
2.构造无向图:
#include <stdio.h>
#include <stdlib.h>
#define MAX_VERtEX_NUM 20
#define VRType int
#define InfoType char
#define VertexType int
typedef struct {
VRType adj;
InfoType * info;
} AdjMatrix[MAX_VERtEX_NUM][MAX_VERtEX_NUM];
typedef struct {
VertexType vexs[MAX_VERtEX_NUM];
AdjMatrix arcs;
int vexnum, arcnum;
}MGraph;
int LocateVex(MGraph * G, VertexType v) {
int i = 0;
for (; i<G->vexnum; i++) {
if (G->vexs[i] == v) {//遍历数组找到数据V
break;
}
}
if (i>G->vexnum) {
printf("no such vertex.\n");
return -1;
}
return i;
}
//构造无向图
void CreateDN(MGraph *G) {
printf("请输入vexnum和arcnum的值:\n");
printf("vexnum :");
scanf_s("%d", &(G->vexnum));
printf("arcnum :");
scanf_s("%d", &(G->arcnum));
printf("请输入顶点vexs的值:\n");
for (int i = 0; i<G->vexnum; i++) {
scanf_s("%d", &(G->vexs[i]));
}
for (int i = 0; i<G->vexnum; i++) {
for (int j = 0; j<G->vexnum; j++) {
G->arcs[i][j].adj = 0;
G->arcs[i][j].info = NULL;
}
}
printf("初始化完成!\n");
printf("请输入关系:\n");
for (int i = 0; i<G->arcnum; i++) {
int v1, v2;
printf("the value of V1:");
scanf_s("%d", &v1);
printf("the value of V2:");
scanf_s("%d", &v2);
int n = LocateVex(G, v1);
int m = LocateVex(G, v2);
if (m == -1 || n == -1) {
printf("no this vertex\n");
return;
}
G->arcs[n][m].adj = 1;
G->arcs[m][n].adj = 1;
//无向图的二阶矩阵沿主对角线对称
}
}
void PrintGrapth(MGraph G)
{
printf("开始打印\n");
printf(" ");
for (int i = 0; i < G.vexnum; i++)
{
printf("%d\t", i);
}
printf("\n");
for (int i = 0; i < G.vexnum; i++)
{
printf("%d ", i);
for (int j = 0; j < G.vexnum; j++)
{
printf("%d\t", G.arcs[i][j].adj);
}
printf("\n\n");
}
return;
}
int main() {
system("title");
MGraph G;
CreateDN(&G);
PrintGrapth(G);
getchar();
system("pause");
}
answer:
3.构造有向网:
#include <stdio.h>
#include <stdlib.h>
#define MAX_VERtEX_NUM 20
#define VRType int
#define InfoType char
#define VertexType int
typedef struct {
VRType adj;
InfoType * info;
} AdjMatrix[MAX_VERtEX_NUM][MAX_VERtEX_NUM];
typedef struct {
VertexType vexs[MAX_VERtEX_NUM];
AdjMatrix arcs;
int vexnum, arcnum;
}MGraph;
int LocateVex(MGraph * G, VertexType v) {
int i = 0;
for (; i<G->vexnum; i++) {
if (G->vexs[i] == v) {//遍历数组找到数据V
break;
}
}
if (i>G->vexnum) {
printf("no such vertex.\n");
return -1;
}
return i;
}
//构造有向网
void CreateUDG(MGraph *G) {
printf("Please inter the value of vexnum and arcnum :\n");
scanf_s("%d", &(G->vexnum));
scanf_s("%d", &(G->arcnum));
printf("Pealse inter the value of vexs:");
for (int i = 0; i<G->vexnum; i++) {
scanf_s("%d", &(G->vexs[i]));
}
for (int i = 0; i<G->vexnum; i++) {
for (int j = 0; j<G->vexnum; j++) {
G->arcs[i][j].adj = 0;
G->arcs[i][j].info = NULL;
}
}
printf("Please inter the relation between in v1 and v1:\n");
for (int i = 0; i<G->arcnum; i++) {
int v1, v2, w;
printf("the value of v1:");
scanf_s("%d", &v1);
printf("the value of v2:");
scanf_s("%d", &v2);
printf("the value of w:");
scanf_s("%d", &w);
int n = LocateVex(G, v1);
int m = LocateVex(G, v2);
if (m == -1 || n == -1) {
printf("no this vertex\n");
return;
}
G->arcs[n][m].adj = w;
}
}
void PrintGrapth(MGraph G)
{
printf("开始打印\n");
printf(" ");
for (int i = 0; i < G.vexnum; i++)
{
printf("%d\t",i);
}
printf("\n");
/*printf(" 0\t1\t2\t\n");*/
for (int i = 0; i < G.vexnum; i++)
{
printf("%d ", i);
for (int j = 0; j < G.vexnum; j++)
{
printf("%d\t", G.arcs[i][j].adj);
}
printf("\n\n");
}
return ;
}
int main() {
system("title");
MGraph G;
CreateUDG(&G);
PrintGrapth(G);
getchar();
system("pause");
}
4.构造无向网:
#include <stdio.h>
#include <stdlib.h>
#define MAX_VERtEX_NUM 20
#define VRType int
#define InfoType char
#define VertexType int
typedef struct {
VRType adj;
InfoType * info;
} AdjMatrix[MAX_VERtEX_NUM][MAX_VERtEX_NUM];
typedef struct {
VertexType vexs[MAX_VERtEX_NUM];
AdjMatrix arcs;
int vexnum, arcnum;
}MGraph;
int LocateVex(MGraph * G, VertexType v) {
int i = 0;
for (; i<G->vexnum; i++) {
if (G->vexs[i] == v) {//遍历数组找到数据V
break;
}
}
if (i>G->vexnum) {
printf("no such vertex.\n");
return -1;
}
return i;
}
//构造无向网。和无向图唯一的区别就是二阶矩阵中存储的是权值
void CreateUDN(MGraph* G) {
printf("Please inter the value of vexnum and arcnum :\n");
scanf_s("%d", &(G->vexnum));
scanf_s("%d", &(G->arcnum));
printf("Pealse inter the value of vexs:\n");
for (int i = 0; i<G->vexnum; i++) {
scanf_s("%d", &(G->vexs[i]));
}
for (int i = 0; i<G->vexnum; i++) {
for (int j = 0; j<G->vexnum; j++) {
G->arcs[i][j].adj = 0;
G->arcs[i][j].info = NULL;
}
}
for (int i = 0; i<G->arcnum; i++) {
int v1, v2, w;
printf("the value of v1:");
scanf_s("%d", &v1);
printf("the value of v2:");
scanf_s("%d", &v2);
printf("the value of w:");
scanf_s("%d", &w);
int m = LocateVex(G, v1);
int n = LocateVex(G, v2);
if (m == -1 || n == -1) {
printf("no this vertex\n");
return;
}
G->arcs[n][m].adj = w;
G->arcs[m][n].adj = w;//矩阵对称
}
}
void PrintGrapth(MGraph G)
{
printf("开始打印\n");
printf(" ");
for (int i = 0; i < G.vexnum; i++)
{
printf("%d\t",i);
}
printf("\n");
/*printf(" 0\t1\t2\t\n");*/
for (int i = 0; i < G.vexnum; i++)
{
printf("%d ", i);
for (int j = 0; j < G.vexnum; j++)
{
printf("%d\t", G.arcs[i][j].adj);
}
printf("\n\n");
}
return ;
}
int main() {
system("title");
MGraph G;
CreateUDN(&G);
PrintGrapth(G);
getchar();
system("pause");
}
answer: