图的邻接表创建方法

#include "example32_graph.h"
#include <stdio.h>
#include <conio.h>
int main()
{
ListGraph G;
cout<<"Is the graph have direction?(0/1)"<<endl;
cin>>G.Graphtype;
}EdgeNode;
//图的邻接链表定义
typedef struct
{
EdgeNode* Adjlist[MAXNUM];
int vertex_num;
int edge_num;
int Graphtype;
}ListGraph;
//生成图的邻接表
void Creatgraph(ListGraph *G)
s=G->Adjlist[i];
while(s)
{
cout<<"->"<<s->Vertex<<"("<<s->weight<<")";
s=s->next;
}
cout<<endl;
}
}
主函数调用测试：
#include "stdafx.h"
{
int i,weight,start,end;
EdgeNode *s;
for(i=0;i<G->vertex_num;i++) //clear the node pointer
G->Adjlist[i]=NULL;
for(i=0;i<G->edge_num;i++) //input the 2 node of each edge and weight
完整代码如下：
//下面介绍图的邻接表创建方法
typedef struct edgenode
{
int Ve //quan
struct edgenode *next; //the next edgenode
Creatgraph(&G);
cout<<"now the new matrix is follow:"<<endl;
OutList(&G);
getch();
return 0;
}
G->Adjlist[start]=s;
if(G->Graphtype == 0)
{
s=(EdgeNode *)malloc(sizeof(EdgeNode));
s->next=G->Adjlist[end];
s->Vertex=start;
s->weight=weight;
{
cout<<"the "<<i+1<<" edge:";
cin>>start>>end>>weight;
s=(EdgeNode *)malloc(sizeof(EdgeNode));
s->next=G->Adjlist[start];
s->Vertex=end;
s->weight=weight;
G->Adjlist[end]=s;
}
}
}
//输出邻接表
void OutList(ListGraph *G)
{
int i;
EdgeNode *s;
for(i=0;i<G->vertex_num;i++)
{
cout<<"Vertex:"<<i<<" ";
cout<<"please input the vertex_number and edge number:"<<endl;
cin>>G.vertex_num>>G.edge_num;
cout<<"input the two nodes of each edge and weight:"<<endl;