C++实现邻接表数据结构详解

//邻接表
#include
using namespace std;
#define MAXNODE 100//最大顶点数
typedef char VertexType;//顶点类型
typedef int EdgeTypd;//边权数据类型
typedef struct EdgeNOde//边表节点
{int node_index;EdgeTypd weight;struct EdgeNOde* next;
}EdgeNOde;
typedef struct VertexNode//顶点表节点
{VertexType data;EdgeNOde *firstedge;
}VertexNode,MyList[MAXNODE];
typedef struct
{MyList mylist;int num_Edge,num_Node;
}GraphList;
void CreateGraph(GraphList &G)
{EdgeNOde *pe;cin>>G.num_Node>>G.num_Edge;for(int i&＃61;0;i<G.num_Node;i&＃43;&＃43;)//读取顶点信息{cin>>G.mylist[i].data;G.mylist[i].firstedge&＃61;NULL;}int vi,vj;for(int j&＃61;0;j<G.num_Edge;j&＃43;&＃43;){cin>>vi>>vj;pe&＃61;(EdgeNOde*)malloc(sizeof(EdgeNOde));pe->node_index&＃61;j;pe->next&＃61;G.mylist[vi].firstedge;G.mylist[vi].firstedge&＃61;pe;pe&＃61;(EdgeNOde*)malloc(sizeof(EdgeNOde));pe->node_index&＃61;vi;pe->next&＃61;G.mylist[vj].firstedge;G.mylist[vj].firstedge&＃61;pe;}
}
int main()
{GraphList G;CreateGraph(G);return 0;
}


参考大佬代码写的模板