#include<stdio.h>
#include<malloc.h>
#include<stdbool.h>
#define VexType char
#define EdgeType int
#define MaxVexNum 100//顶点数目的最大值
#define QElemType VexType
#define MAXSIZE 100
typedef struct{
VexType Vex[MaxVexNum];//顶点
EdgeType Edge[MaxVexNum][MaxVexNum];//边的权
int vexnum,arcnum;//顶点数、边数
}Graph;
//初始化
void InitGraph(Graph &G){
G.vexnum = G.arcnum = 0;
}
//输入顶点
void InsertVex(Graph &G,VexType v){
G.Vex[G.vexnum++] = v;
}
//定位
int LocateVex(Graph &G,VexType v){
for(int i=0;i<=G.vexnum;i++){
if(v == G.Vex[i]) return i;
}
return -1;
}
//输入边(此处用无向图举例)
void InsertEdge(Graph &G,VexType v1,VexType v2,EdgeType e){
int v1num = LocateVex(G,v1);
int v2num = LocateVex(G,v2);
G.Edge[v1num][v2num] = G.Edge[v2num][v1num] = e;
G.arcnum += 2;
}
//打印图的邻接矩阵
void ShowGraph(Graph &G){
printf(" ");
for(int i=0;i<=G.vexnum;i++){
printf("%c ",G.Vex[i]);
}
printf("\n");
for(int i=0;i<G.vexnum;i++){
printf("%c ",G.Vex[i]);
for(int j=0;j<G.vexnum;j++){
printf("%d ",G.Edge[i][j]);
}
printf("\n");
}
printf("\n");
}
bool visited[MaxVexNum] = {false};//访问数组(用来确定元素是不是已经被访问)
//第一个邻接元素
int FirstNeighbor(Graph &G,VexType v){
int vnum = LocateVex(G,v);
for(int i=0;i<G.vexnum;i++){
if(G.Edge[vnum][i]!=0 && visited[i] == false)
return i;
}
return -1;
}
//下一个邻接元素
int NextNeighbor(Graph &G,VexType v,int v2num){
int vnum = LocateVex(G,v);
for(int i = v2num+1;i<G.vexnum;i++){
if(G.Edge[vnum][i] != 0 && visited[i] == false)
return i;
}
return -1;
}
//DFS
void DFS(Graph &G, VexType v){
int vnum = LocateVex(G,v);
printf("%c-->",v);
visited[vnum] = 1;
for(int i = FirstNeighbor(G,v) ; i >= 0;i = NextNeighbor(G,v,i)){
if(visited[i] == 0) DFS(G,G.Vex[i]);
}
}
//DFSTraverse(防止非连通图)
void DFSTraverse(Graph &G){
for(int i=0;i<G.vexnum;i++){
if(visited[i] == false) DFS(G,G.Vex[i]);
}
}
//队列
typedef struct{
QElemType data[MAXSIZE];//用静态数组存放队列元素
int front,rear;//队头指针和队尾指针
}SqQueue;
void InitQueue(SqQueue &Q){
Q.front = Q.rear = 0;
}
int QueueEmpty(SqQueue &Q){
if(Q.front == Q.rear)
return 1;
else
return 0;
}
void EnQueue(SqQueue &Q,QElemType x){
Q.data[Q.rear++] = x;
}
void DeQueue(SqQueue &Q,QElemType &x){
x = Q.data[Q.front++];
}
SqQueue Q;
//BFS
void BFS(Graph &G,VexType v){
printf("%c-->",v);
int vnum = LocateVex(G,v);
visited[vnum] = true;
EnQueue(Q,v);//元素入队
while(!QueueEmpty(Q)){
DeQueue(Q,v);//元素出队
for(int i=FirstNeighbor(G,v);i>=0;i=NextNeighbor(G,v,i)){
if(!visited[i]){
printf("%c-->",G.Vex[i]);
visited[i] = true;
EnQueue(Q,G.Vex[i]);
}
}
}
}
//BFSTraverse(防止非连通图)
void BFSTraverse(Graph &G){
InitQueue(Q);
for(int i=0;i<G.vexnum;i++){
if(!visited[i]) BFS(G,G.Vex[i]);
}
}
int main(){
Graph G;
InitGraph(G);
InsertVex(G,'A');
InsertVex(G,'B');
InsertVex(G,'C');
InsertVex(G,'D');
InsertVex(G,'E');
InsertEdge(G,'A','B',1);
InsertEdge(G,'A','C',2);
InsertEdge(G,'B','D',2);
InsertEdge(G,'A','E',2);
ShowGraph(G);
DFSTraverse(G);
return 0;
}