c++实现邻接表

关注

原创最新推荐文章于 2026-02-15 00:29:19 发布 2.2k 阅读 AI 写同款· GEO 优化 ›

数据结构C++使用邻接表实现图定义邻接表存储的图类。 [实验要求] （1）创建一个邻接表存储的图；（2）返回图中指定边的权值；（3）插入操作：向图中插入一个顶点，插入一条边；（4）删除操作：从图中删除一个顶点，删除一条边；（5）图的广度优先遍历；（6）基于迪杰斯特拉算法求最短路径。【选作】 [截图] 实验例图 邻接表 操作截图 [实现代码] 一共四个文件：AQueue.h、Graph_Li... 阅读详情

#include<iostream>
using namespace std;

const int MAX = 10;
//声明边表结点
struct edge_node
{
	int adjvex; //邻接点域,储存该顶点对应的下标
	int weight; //权值
	edge_node *next; //指向边表下一个结点
};

//声明顶点表结点
struct vertex_node
{
	char vertex;  //顶点
	edge_node *first_edge; //指向边表第一个结点
};

class Graph
{
private:
	vertex_node adjlist[MAX]; //存放顶点的数组
	int vertex_num; //顶点数
	int edge_num; //边数
public:
	Graph(); //构造函数
	int locate(char ch); //定位
	void print(); //打印
};


//定位
int Graph::locate(char ch)
{
	int i = 0;
	for (i = 0; i < this->vertex_num; i++)
	{
		if (this->adjlist[i].vertex == ch)
		{
			break;
		}
	}
	return i;
}

//打印
void Graph::print()
{
	int i = 0;
	while (this->adjlist[i].first_edge != nullptr && i < this->vertex_num)
	{
		cout << "顶点：" << this->adjlist[i].vertex;
		edge_node *s = nullptr;
		s = this->adjlist[i].first_edge;
		while (s != nullptr)
		{
			cout << "->"
				<< "(" << s->adjvex
				<< "," << s->weight << ")";
			 s = s->next;
		}
		i++;
		cout << endl;
	}
}

//构造函数
Graph::Graph()
{
	int i = 0, j = 0, k = 0, w = 0;
	cout << "请输入顶点数和边数：" << endl;
	cin >> this->vertex_num >> this->edge_num;

	 
	cout << "请依次输入顶点：" << endl;
	for (i = 0; i < this->vertex_num; i++)
	{
		cin >> this->adjlist[i].vertex;
		this->adjlist[i].first_edge = nullptr;
	}


	cout << "请输入两个顶点及其权值：" << endl;
	for (k = 0; k < this->edge_num; k++)
	{
		char first, second;
		edge_node *s, *e = nullptr;

		cin >> first >> second >> w;
		i = this->locate(first);
		j = this->locate(second);
		s = new edge_node;
		s->adjvex = j;
		s->weight = w;
		s->next = this->adjlist[i].first_edge;
		this->adjlist[i].first_edge = s;

		//无向图
		e = new edge_node;
		e->adjvex = i;
		e->weight = w;
		e->next = this->adjlist[j].first_edge;
		this->adjlist[j].first_edge = e;
	}

	
}


int main()
{

	Graph g;
	g.print();
	system("pause");
	return 0;
}