图的邻接表存储定义了一个边表和一个顶点表分别存储边的信息和顶点的信息
本次存储的是一个有向图,对于网图,则需在边表设置一个权值(如权值info)
对于存储的图结构中容易解决(边的度(出度和入度),判断两顶点间是否存在边,以及容易得到一个顶点的所有邻接点)
遍历
一.dfs(深度优先遍历)
类似于树的前序遍历,利用递归的思想遍历图的所有节点
二.bfs(广度优先遍历)
类似于树的层序遍历,同样用队列对每一个即将遍历的顶点进行入队出队操作,同时将他的邻接节点入队,直到队列为空。(可以用数组模拟队列的出队,入队操作)
为了在遍历过程中区分顶点是否被访问,设置一个访问标志数组visited[i],其初值为0,如果被访问,则置为0;
#include<iostream>
#include<string.h>
#include<queue>
#define Size 10
using namespace std;
int visited[Size];
struct ArcNode
{
int adjvex;
ArcNode *next;
};//边表
//template <class T>
struct VerNode
{
char ver;
ArcNode *first;
};//顶点表
//template <class T>
class ALGraph
{
public:
void create(char a[],int n,int e);
void DFS(int v);
void BFSA(int v);// 数组版
void BFSB(int v);//队列版
private:
VerNode adjlist[Size];//顶点表集
int verNum,arcNum;
};
void ALGraph::create(char a[],int n,int e)
{
int i,j,k;
ArcNode *s;
verNum = n;arcNum = e;
for(i = 0;i < verNum;i ++){
adjlist[i].ver = a[i];
adjlist[i].first = NULL;
}
for(k = 0;k < arcNum;k ++){
cout<<"边依附的两个顶点下标: ";
cin>>i>>j;
s = new ArcNode;
s -> adjvex = j;
s -> next = adjlist[i].first;
adjlist[i].first = s;
}
}
void ALGraph::BFSA(int v)
{
int queue[Size];
int rear,front,i,j,tem;
ArcNode *p;
memset(visited,0,sizeof(visited));
rear = front = -1;
queue[++ rear] = v;
visited[v] = 1;
p = adjlist[v].first;
cout<<adjlist[v].ver<<" ";
while(rear != front)
{
v = queue[++ front];
p = adjlist[v].first;
while(p != NULL){
j = p->adjvex;
if(visited[j] == 0){
cout<<adjlist[j].ver<<" ";
visited[j] = 1;
queue[++ rear] = j;
}
p = p->next;
}
}
}
void ALGraph::BFSB(int v)
{
queue<int> q;
int j;
ArcNode *p;
memset(visited,0,sizeof(visited));
q.push(v);
visited[v] = 1;
cout<<adjlist[v].ver<<" ";
p = adjlist[v].first;
while(!q.empty())
{
v = q.front(); q.pop();
p = adjlist[v].first;
while(p)
{
j = p->adjvex;
if(visited[j] == 0){
cout<<adjlist[j].ver<<" ";
q.push(j);
}
p = p->next;
}
}
}
void ALGraph::DFS(int v)
{
int j;
ArcNode *p;
cout<<adjlist[v].ver<<" ";
visited[v] = 1;
p = adjlist[v].first;
while(p)
{
j = p->adjvex;
if(visited[j] == 0)DFS(j);
p = p->next;
}
}
main()
{
ALGraph q;
int i,j,n,e;
char a[Size];
cin>>a;
cout<<"顶点个数 and 边的个数: ";
cin>>n>>e;
q.create(a,n,e);
//q.BFSA(0);
//q.BFSB(0);
memset(visited,0,sizeof(visited));
q.DFS(0);
}
/*
abcd
4 4
0 1
0 2
2 3
3 0
*/