结构分析:
![邻接表](https://img-blog.csdnimg.cn/dd7e40b317aa4a6e8a7b0b0b9a8e6e4e.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBAVmFyX2Fs,size_20,color_FFFFFF,t_70,g_se,x_16#pic_center)
算法思想:
- 输入总顶点数和总边数
- 建立顶点表,依次输入信息存于顶点表中,将每个顶点头节点的指针域初始化为NULL
- 创建邻接表,依次输入边所依附的两个顶点,确定两个顶点的下标 i 和 j ,建立边结点,使用头插法分别差入 vi 和 vj 对应的边链表的头部
存储表示:
#define MaxInt 32767
#define MVNum 100
typedef int ArcType;
typedef char VerTexType;
struct ArcNode
{
int adjvex;
struct ArcNode *nextarc;
ArcType info;
};
typedef struct VNode
{
VerTexType data;
struct ArcNode *firstarc;
} VNode, AdjList[MVNum];
typedef struct
{
AdjList vertices;
int vexnum, arcnum;
} ALGraph;
算法实现:
Status CreateUDG(ALGraph &G)
{
cin >> G.vexnum >> G.arcnum;
for (int i = 0; i < G.vexnum; ++i)
{
cin >> G.vertices[i].data;
G.vertices[i].firstarc = NULL;
}
for (int k = 0; k < G.arcnum; ++k)
{
char v1, v2;
cin >> v1 >> v2;
int i = LocateVex(G, v1);
int j = LocateVex(G, v2);
ArcNode *p1 = new ArcNode;
p1->adjvex = j;
p1->nextarc = G.vertices[i].firstarc;
G.vertices[i].firstarc = p1;
ArcNode *p2 = new ArcNode;
p2->adjvex = i;
p2->nextarc = G.vertices[j].firstarc;
G.vertices[j].firstarc = p2;
}
return 0;
}
int LocateVex(ALGraph G, VerTexType u)
{
int i;
for (int i = 0; i < G.vexnum; ++i)
if (u == G.vertices[i].data) return i;
return -1;
}
邻接矩阵特点:
- 方便找任一顶点的所有“邻接点”
- 方便计算任一顶点的度?对无向图来说:是的;对有向图来说:只能计算“出度”,需要构造“逆邻接表”来方便计算“入度”
- 不方便计算任意一对顶点是否有边
- 存储空间为O(n+2e)
【C++】图的构造算法-邻接矩阵表示法