#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef int Vertex;
typedef struct edge_node* Edge;
typedef struct graph_type* Graph;
typedef int Item;
struct edge_node
{
int v1, v2;
};
struct graph_type
{
int V;
int E;
int G[10][10];
Item val[10];
};
static void terminate(const char* message);
Graph create(Vertex v);
Graph insert(Graph g, Edge e);
Graph delete(Graph g, Edge e);
static void terminate(const char* message)
{
printf("%s\n", message);
exit(EXIT_FAILURE);
}
Graph create(Vertex v)
{
Graph g = malloc(sizeof(struct graph_type));
if (g == NULL)
{
terminate("Error int create: malloc falied in create a new graph.");
}
g->V = v;
g->E = 0;
for (int i = 0; i < v; i++)
{
for (int j = 0; j < v; j++)
{
g->G[i][j] = false;
}
}
return g;
}
Graph insert(Graph g, Edge e)
{
return g->G[e->v1][e->v2]=true;
}
Graph delete(Graph g, Edge e)
{
return g->G[e->v1][e->v2] = false;
}
简单有向图的邻接矩阵
最新推荐文章于 2023-09-08 06:15:00 发布
这篇博客介绍了如何使用C语言实现图结构,包括创建图、插入边和删除边的操作。`Graphcreate`函数用于初始化图,`Graphinsert`和`Graphdelete`分别用于增加和移除图中顶点之间的边。这些基本操作对于理解和处理图论问题至关重要。
摘要由CSDN通过智能技术生成