/**
*
* Althor: Hacker Hao
* Create: 2023.11.22
*
*/
#include <bits/stdc++.h>
using namespace std;
#define MAXSIZE 200
#define InfoType int
#define VertexType int
//边的结构
typedef struct ArcNode {
int adjvex; //边指向的顶点位置
struct ArcNode* nextarc;
}ArcNode;
//顶点结构
typedef struct VNode {
char data; //顶点信息
ArcNode* firstarc; //指向第一条依附于此顶点的指针
}VNode, AdjList[MAXSIZE];
//图的结构
typedef struct {
AdjList vertices; //定义一个数组,是vertex的复数形式
int vexnum, arcnum;
}ALGraph;
int LocateVex(ALGraph G, int u)
//查找点u,有则返回下标,无则返回-1
{
int i;
for (int i = 0; i <= G.vexnum; i++)
{
if (u == G.vertices[i].data)
return i;
}
return -1;
}
bool CreateGraph(ALGraph& G)
{
cout << "请输入总结点数和总边数:" << endl;
cin >> G.vexnum >> G.arcnum;
cout << " 输入各顶点值: " << endl;
for (int i = 1; i <= G.vexnum; i++)
{
cin >> G.vertices[i].data; //输入顶点值
G.vertices[i].firstarc = NULL;
}
cout << "输入一条边依附的两个顶点值" << endl;
for (int k = 1; k <= G.vexnum; k++)
{
char v1, v2;
cin >> v1 >> v2; //一条边依附的两个顶点
int i = LocateVex(G, v1);
int j = LocateVex(G, v2); //确定顶点在G中的序号
ArcNode* p1 = new ArcNode;
p1->adjvex = j; //邻接点序号为j
p1->nextarc = G.vertices[i].firstarc;
G.vertices[i].firstarc = p1; //将新结点*p1插入vi的边表头部
ArcNode* p2 = new ArcNode;
p2->adjvex = i; //邻接点序号为i
p2->nextarc = G.vertices[j].firstarc;
G.vertices[j].firstarc = p2; //插入*p2
}
return true;
}
int main()
{
cin.tie(0), cout.tie(0);
ALGraph G;
ArcNode* p;
CreateGraph(G);
cout << "输出邻接表: " << endl;
for (int i = 1; i <= G.vexnum; i++)
{
cout << G.vertices[i].data;
for (p = G.vertices[i].firstarc; p != NULL; p = p->nextarc)
cout << "->" << p->adjvex;
cout << endl;
}
return 0;
}
C/C++:邻接表存储
最新推荐文章于 2024-08-13 16:22:10 发布