使用邻接表创建有向图,可以使用数组+链表的方式创建。
定义的顶点表如下
生成代码如下
char c;
for (int i = 0; i < graph->n; ++i) {
cin >> c;
graph->adj_list[i].data = c;
graph->adj_list[i].first_arc = nullptr;
}
我们的图的整体结构如下图所示
整体的生成方式是先生成顶点表,接着再依次遍历顶点表,将表中节点所对应的节点进行连接。
完整代码如下:
#include <iostream>
using namespace std;
//采用邻接表存储节点
#define MaxSize 10
// 定义边
typedef struct arc_node {
int adj_vex; //该边所指向节点的位置
struct arc_node *next_arc;
} ArcNode;
//定义顶点
typedef struct vnode {
char data;
ArcNode *first_arc;
} VNode;
//图的基本信息
typedef struct {
VNode adj_list[MaxSize];
int n, e;
} AGraph;
AGraph *init_Graph();
void CreateGraph(AGraph *graph);
int main() {
//有向图
//A,B,C,D
//n=4,e=6
auto graph = init_Graph();
CreateGraph(graph);
return 0;
}
AGraph *init_Graph() {
auto graph = new AGraph;
graph->n = 4;
graph->e = 4;
return graph;
}
void CreateGraph(AGraph *graph) {
char c;
for (int i = 0; i < graph->n; ++i) {
cin >> c;
graph->adj_list[i].data = c;
graph->adj_list[i].first_arc = nullptr;
}
int vi, vj;
for (int i = 0; i < graph->e; ++i) {
cin >> vi >> vj;
auto newNode = new ArcNode;
newNode->adj_vex = vj; //边所指向的节点
newNode->next_arc = graph->adj_list[vi].first_arc;
graph->adj_list[vi].first_arc = newNode; //表中结点的边
}
}