邻接表1

试在邻接表存储结构上实现图的基本操作 insert_vertex 和 insert_arc，相关定义如下：

typedef int VertexType;typedef enum{DG, UDG
}GraphType;typedef struct ArcNode
{int adjvex;InfoPtr *info;struct ArcNode *nextarc;}ArcNode;typedef struct VNode
{VertexType data;ArcNode *firstarc;
}VNode;
typedef struct
{VNode vertex[MAX_VERTEX_NUM];int vexnum, arcnum;GraphType type;
}ListGraph;int locate_vertex(ListGraph* G, VertexType v); //返回顶点 v 在vertex数组中的下标，如果v不存在，返回-1
bool insert_vertex(ListGraph *G, VertexType v);
bool insert_arc(ListGraph *G, VertexType v, VertexType w);

注意判断条件:

成功插入顶点或边时，函数返回true，否则（如顶点或边已存在、插入边时顶点v或w不存在）返回false。

#include <stdio.h>
#include "graph.h" //请勿删除，否则检查不通过
bool insert_vertex(ListGraph *G, VertexType v){int n;n = locate_vertex(G, v);if(n == -1){//if(G->type == DG || G->type == UDG){G->vertex[G->vexnum].data = v;G->vertex[G->vexnum].firstarc = NULL;G->vexnum++;return true;}elsereturn false;}bool insert_arc(ListGraph *G, VertexType v, VertexType w){int i, j;ArcNode *p;bool flag = true;i = locate_vertex(G, v);j = locate_vertex(G, w);if(i == -1|| j == -1)return false;for(p = G->vertex[i].firstarc; p->adjvex != w; p = p->nextarc);if(p->adjvex == w) 	flag = false;for(p = G->vertex[j].firstarc; p->adjvex != v; p = p->nextarc);if(p->adjvex == v) flag = false;if(!flag) return false;if(G->type == UDG){p->nextarc = G->vertex[j].firstarc;p->adjvex = v;G->vertex[j].firstarc = p; }p->nextarc = G->vertex[i].firstarc;p->adjvex = w;G->vertex[i].firstarc = p; G->arcnum++;return true;
}