#include <iostream.h>
#include <stdlib.h>
#include <stdio.h>
#define True 1
#define False 0
#define Error -1
#define Ok 1
#define INFINITY 0
#define MAX_VERTEX_NUM 10 //最大顶点数
#define MAX_EDGE_NUM 40 //最大边数
typedef enum {DG,DN,UDG,UDN}Graphkind;
typedef char VertexType; //顶点数据类型
typedef struct ArcCell
{
int adj; //无权图，1或0表示相邻否；带权图则是权值。
//int *info;
}ArcCell,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];
typedef struct
{
VertexType vexs[MAX_VERTEX_NUM]; //顶点向量
AdjMatrix arcs; //邻接矩阵
int vexnum,arcnum; //图的当前顶点数和弧数。
Graphkind kind;
}MGraph;
typedef struct ArcNode
{
int adjvex;
int weight;
struct ArcNode *nextarc;
}ArcNode;
typedef struct VNode
{
int data;
ArcNode *firstarc;
}VNode,AdjList[MAX_VERTEX_NUM];
typedef struct
{
AdjList vertices;
int vexnum,arcnum;
int kind;
}ALGraph;
int LocateVex(MGraph G,VertexType v1)
{
int i;
for(i=0;i<G.vexnum;i++)
if(G.vexs[i]==v1)
return i;
return -1;
}
typedef struct Node
{
int data;
struct Node *next;
}LinkQueueNode;
typedef struct
{
LinkQueueNode *front;
LinkQueueNode *rear;
}LinkQueue;
int InitQueue(LinkQueue *Q)
{
Q->front=(LinkQueueNode*)malloc(sizeof(LinkQueueNode));
if(Q->front!=NULL)
{
Q->rear=Q->front;
Q->front->next=NULL;
return(True);
}
else
return(False);
}
int EnterQueue(LinkQueue *Q,int x)
{
LinkQueueNode *NewNode;
NewNode=(LinkQueueNode*)malloc(sizeof(LinkQueueNode));
if(NewNode!=NULL)
{
NewNode->data=x;
NewNode->next=NULL;
Q->rear->next=NewNode;
Q->rear=NewNode;
return(True);
}
else
return(False);
}
int DeleteQueue(LinkQueue *Q,int *x)
{
LinkQueueNode *p;
if(Q->front==Q->rear)
return(False);
p=Q->front->next;
Q->front->next=p->next;
if(Q->rear==p)
Q->rear=Q->front;
*x=p->data;
free(p);
return(True);
}
int IsEmpty(LinkQueue *Q)
{
if(Q->front==Q->rear)
return(True);
else
return(False);
}
int visited[MAX_VERTEX_NUM];
int CreatDN(MGraph &G1,ALGraph &G2)
// 采用数组表示法，构造有向网 G
{
int b;
ArcNode *p;
VertexType v1,v2;
int w,j;
cout<<“输入图的顶点数及弧数“<<endl;
cin>>G1.vexnum>>G1.arcnum;
G2.vexnum=G1.vexnum;
G2.arcnum=G1.arcnum;
cout<<“输入顶点向量“<<endl;
for(int i=0;i<G1.vexnum;i++)
{
cin>>G1.vexs[i];
}
for(i=0;i<G1.vexnum;i++)
for(j=0;j<G1.vexnum;j++)
{
G1.arcs[i][j].adj=INFINITY;
}
for(i=0;i<G2.vexnum;i++)
{
G2.vertices[i].data=i;
G2.vertices[i].firstarc=NULL;
}
cout<<“输入边依附的两个顶点及此边的权值“<<endl;
for(int k=0;k<G1.arcnum;++k) //构造邻接矩阵
{
cout<<“please input:”;
cin>>v1>>v2>>w;
i=LocateVex(G1,v1);
j=LocateVex(G1,v2);
G1.arcs[i][j].adj=w;
p=(ArcNode*)malloc(sizeof(ArcNode));
b=w;
p->adjvex=j;
p->weight=b;
p->nextarc=G2.vertices[i].firstarc;
G2.vertices[i].firstarc=p;
}
return 1;
}
void dispMGraph(MGraph G)
{
cout<<“图的邻接矩阵图是：“<<endl;
for(int i=0;i<G.vexnum;i++)
{
for(int j=0;j<G.vexnum;j++)
cout<<” “<<G.arcs[i][j].adj;
cout<<endl;
}
}
void Depth1(MGraph g1,int vo)
{
int vj;
printf(“%c”,g1.vexs[vo]);
visited[vo]=True;
for(vj=0;vj<g1.vexnum;vj++)
if((!visited[vj])&&(!g1.arcs[vo][vj].adj==0))
Depth1(g1,vj);
}
void Breadth1(MGraph g1,int vo)
{
int vi,vj;
LinkQueue Q;
InitQueue(&Q);
visited[vo]=True;
EnterQueue(&Q,vo);
while(!IsEmpty(&Q))
{
DeleteQueue(&Q,&vi);
printf(“%c”,g1.vexs[vi]);
for(vj=0;vj<g1.vexnum;vj++)
if((!visited[vj])&&(!g1.arcs[vi][vj].adj==0))
{
visited[vj]=True;
EnterQueue(&Q,vj);
}
}
}
void Traverse1(MGraph g1)
{
int vi;
for(vi=0;vi<g1.vexnum;vi++)
visited[vi]=False;
printf(“/n深度优先遍历的结果:/n”);
for(vi=0;vi<g1.vexnum;vi++)
{
if(!visited[vi])
{
Depth1(g1,vi);
printf(“/n”);
}
}
for(vi=0;vi<g1.vexnum;vi++)
visited[vi]=False;
printf(“/n广度优先遍历的结果:/n”);
for(vi=0;vi<g1.vexnum;vi++)
{
if(!visited[vi])
{
Breadth1(g1,vi);
printf(“/n”);
}
}
}
void change1(MGraph G){
cout<<“图的邻接矩阵转化为邻接表如下：“;
cout<<endl;
for(int i=0;i<G.vexnum;i++)
{
for(int j=0;j<G.vexnum;j++){
if(G.arcs[i][j].adj!=0){
cout<<“(“<<G.vexs[i]<<“,”<<G.vexs[j]<<“, “<<G.arcs[i][j].adj<<“)”<<“ “;
}
}
cout<<endl;
}}
void change2(ALGraph G){
int a [MAX_VERTEX_NUM][MAX_VERTEX_NUM]; int i,j,m;
ArcNode *p;
cout<<“图的邻接表转化为邻接矩阵如下：“<<endl;
for(i=0;i<G.vexnum;i++)
{
p=G.vertices[i].firstarc;
while(p!=NULL)
{ m=p->adjvex;
a[i][m]=p->weight;
p=p->nextarc;
} }
for(i=0;i<G.vexnum;i++) {
for(j=0;j<G.vexnum;j++){
if(a[i][j]>0);
else a[i][j]=0;}}
for(i=0;i<G.vexnum;i++) {
for(j=0;j<G.vexnum;j++){
cout<<a[i][j]<<” “;}
cout<<endl;}
}
void main()
{
int a;
MGraph G1; ALGraph G2;
printf(“建立有向图 “);
CreatDN(G1,G2);
dispMGraph(G1);
Traverse1(G1);
}
