图的数据结构实现

#include"iostream"
#include"malloc.h" 
#include"queue"
using namespace std;
#define MAX 50
typedef struct node{
    int adjvex;    //拎接点域 
    struct node *next; //链域 
    int weight;
}EdgeNode;
typedef struct vnode{
    int vertex;        //顶点域 
    EdgeNode *firstedge;//边表头指针 
}VertexNode;
 typedef VertexNode AdjList[MAX];
 
 typedef struct{
     AdjList adjlist;//邻接表     
     int n;
    int e;
               //图中当前顶点和边数 
 }AlGraph;
 //建立图的邻接表 
 void CreatAlGraph(AlGraph *G){
     EdgeNode *s;        //定义边表节点
     int i,j,k;
     int a;
     cout<<"请输入顶点边和边数"<<endl;
     cin>>i>>j;
     G->n=i;
     G->e=j;
     cout<<"请输入顶点编号"<<endl;
     for(i=0;i<G->n;i++){
         cin>>a;
         G->adjlist[i].vertex=a;
        G->adjlist[i].firstedge=NULL; 
     } 
     cout<<"请输入由两个顶点构成的边，"<<endl;
     for(k=0;k<G->e;k++){
         cin>>i>>j;
         s=(EdgeNode*)malloc(sizeof(EdgeNode));
         s->adjvex=j;
         s->next=G->adjlist[i].firstedge;
         G->adjlist[i].firstedge=s;//将新节点s插入顶点BI的边表头部
        /*若建立无向图，则添加下面的代码*/
        s=(EdgeNode*)malloc(sizeof(EdgeNode));
        s->adjvex=i;
        s->next=G->adjlist[j].firstedge;
        G->adjlist[j].firstedge=s;      
     }
 }
 //深度优先算法 
 bool visited[MAX];
 void DFS(AlGraph *G,int i){//以VI为出发点对邻接表的进行DFS 
     EdgeNode *p;
     cout<<G->adjlist[i].vertex;
     visited[i]=true;
     p=G->adjlist[i].firstedge;
     while(p){
         if(!visited[p->adjvex])
             DFS(G,p->adjvex);
         p=p->next;
     }
 }
  void DepthFirstsearch(AlGraph *G,int v){
     for(int i=0;i<G->n;i++)    
         visited[i]=false;
     DFS(G,v);
 }
 void BFS(AlGraph *G,int v){
     EdgeNode *p;
     queue<int>Q;
     visited[v]=true;
     Q.push(v);
     while(!Q.empty()){
         int v=Q.front();
         cout<<v;
         Q.pop();
         p=G->adjlist[v].firstedge;
         while(p){
             if(!visited[p->adjvex]){ 
                 visited[p->adjvex]=true;
                 Q.push(p->adjvex);
            } 
            p=p->next;
         }
     }
 }
 void BFSEARCH(AlGraph *G,int v){
     for(int i=0;i<G->n;i++)    
         visited[i]=false;
     BFS(G,v);
 }
 int main(){
     AlGraph *G=(AlGraph*)malloc(sizeof(AlGraph));
    CreatAlGraph(G);
     DepthFirstsearch(G,0);
     cout<<endl;
     BFSEARCH(G,0);
     return 0;
 }