C++ Exercises（十七）--图的简单实现

<!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />-->constintMAXSIZE=50;//顶点最大数目

#include<vector>
usingnamespacestd;

template<typenameT>
classCGraph
{
public:
CGraph(void);
~CGraph(void);
private:
vector<T>vecNodes;//顶点列表
intedge[MAXSIZE][MAXSIZE];//边表
intnumVertexs;//顶点数
intnumEdges;//边数
boolvisited[MAXSIZE];//用于图的遍历

intFindVertex(constT&vertex,constvector<T>&lst);
voidClearVisitFlag();
vector<T>&GraphDepthFirstSearch(constT&beginVertex);//深度遍历图
vector<T>&GraphBreadthFirstSearch();//广度遍历

public:
boolGraphEmpty(void)const;
boolGraphFull(void)const;
intNumberOfVertices(void)const;//获取顶点数
intNumberOfEdges(void)const;//获取边数
intGetWeight(constT&vertex1,constT&vertex2);//获取指定两个顶点间的权值
vector<T>&GetNeighbors(constT&vertex);//获取指定顶点的邻接顶点

voidCreateGraph();//创建图
intGetVertexPos(constT&vertex);//获取指定顶点的位置

intInsertVertex(constT&vertex);//插入顶点
voidInsertEdge(constT&vertex1,constT&vertex2,intweight);//插入边
voidDeleteVertex(constT&vertex);//删除顶点
voidDeleteEdge(constT&vertex1,constT&vertex2);//删除边

//intMinimumPath(constT&sVertex,constT&desVertex);最短路径
voidDepthFirstSearch();//深度遍历图
voidBreadthFirstSearch();//广度遍历图
};

图的实现代码
<!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />-->#include"Graph.h"
#include<stack>
#include<queue>
#include<algorithm>
#include<iostream>

usingnamespacestd;

template<typenameT>
CGraph<T>::CGraph(void)
{
for(inti=0;i<MAXSIZE;++i)
{
for(intj=0;j<MAXSIZE;++j)
{
this->edge[i][j]=0;
}
}
this->numVertexs=0;
this->numEdges=0;
}
template<typenameT>
CGraph<T>::~CGraph(void)
{
this->vecNodes.clear();
for(inti=0;i<MAXSIZE;++i)
{
for(intj=0;j<MAXSIZE;++j)
{
this->edge[i][j]=0;
}
}
this->numVertexs=0;
this->numEdges=0;
}
template<typenameT>
intCGraph<T>::NumberOfEdges()const
{
returnthis->numEdges;
}
template<typenameT>
intCGraph<T>::NumberOfVertices()const
{
returnthis->numVertexs;
}
template<typenameT>
intCGraph<T>::GetWeight(constT&vertex1,constT&vertex2)
{
intpos1,pos2;
pos1=this->GetVertexPos(vertex1);
pos2=this->GetVertexPos(vertex2);
returnthis->edge[pos1][pos2];
}
template<typenameT>
boolCGraph<T>::GraphFull()const
{
returnthis->numVertexs>=MAXSIZE;
}
template<typenameT>
boolCGraph<T>::GraphEmpty()const
{
returnthis->numVertexs==0;
}
template<typenameT>
intCGraph<T>::InsertVertex(constT&vertex)
{//插入顶点,返回插入位置
intresult=-1;
if(!this->GraphFull())
{
this->vecNodes.push_back(vertex);
result=this->numVertexs;
this->numVertexs++;
}
}
template<typenameT>
voidCGraph<T>::InsertEdge(constT&vertex1,constT&vertex2,intweight)
{//插入边
intpos1,pos2;
pos1=this->GetVertexPos(vertex1);
pos2=this->GetVertexPos(vertex2);
if(pos1==-1&&pos2==-1)
{//两个都是新顶点
pos1=this->InsertVertex(vertex1);
pos2=this->InsertVertex(vertex2);

}
elseif(pos1==-1)
{//一个是新顶点
pos1=this->InsertVertex(vertex1);
}
elseif(pos2==-1)
{
pos2=this->InsertVertex(vertex2);
}
this->edge[pos1][pos2]=weight;
this->edge[pos2][pos1]=weight;
}
template<typenameT>
voidCGraph<T>::DeleteVertex(constT&vertex)
{//删除顶点
intpos=this->GetVertexPos(vertex);
if(pos!=-1)
{
this->vecNodes.erase(remove(this->vecNodes.begin(),this->vecNodes.end(),vertex),this->vecNodes.end());//删除顶点
for(inti=0;i<this->numVertexs;++i)
{
if(this->edge[pos][i]>0)
this->edge[pos][i]=0;
if(this->edge[i][pos]>0)
this->edge[i][pos]=0;
}
this->numVertexs--;
this->numEdges--;
}
}
template<typenameT>
voidCGraph<T>::DeleteEdge(constT&vertex1,constT&vertex2)
{//删除边
intpos1,pos2;
pos1=this->GetVertexPos(vertex1);
pos2=this->GetVertexPos(vertex2);
if(pos1!=-1&&pos2!=-1)
{
if(this->edge[pos1][pos2]>0)
{
this->edge[pos1][pos2]=0;
this->edge[pos2][pos1]=0;
this->numEdges--;
}
}
}

template<typenameT>
voidCGraph<T>::CreateGraph()
{//创建图
cout<<"输入顶点数，边数:";
cin>>this->numVertexs;
cin>>this->numEdges;

inti;
Titem;
cout<<"输入顶点:";
for(i=0;i<this->numVertexs;++i)
{
cout<<"第"<<i+1<<"个顶点:";
cin>>item;
this->vecNodes.push_back(item);
}
Tvert1,vert2;
intpos1,pos2,weight;
for(i=0;i<this->numEdges;++i)
{
cout<<"输入第"<<i+1<<"条边(尾，头，权值):";
cin>>vert1>>vert2>>weight;
pos1=this->GetVertexPos(vert1);
pos2=this->GetVertexPos(vert2);
this->edge[pos1][pos2]=weight;
this->edge[pos2][pos1]=weight;
}
}
template<typenameT>
intCGraph<T>::GetVertexPos(constT&vertex)
{//获取顶点位置
returnthis->FindVertex(vertex,this->vecNodes);
}
template<typenameT>
intCGraph<T>::FindVertex(constT&vertex,constvector<T>&lst)
{//在顶点列表中找指定数据的下标
intpos=-1;
for(pos=lst.size()-1;pos>=0;--pos)
{
if(lst[pos]==vertex)
{
break;
}
}
returnpos;
}

template<typenameT>
vector<T>&CGraph<T>::GraphDepthFirstSearch(constT&beginVertex)
{//深度遍历
vector<T>*result=newvector<T>();
vector<T>adjLst;
stack<T>s;
s.push(beginVertex);
intpos;
Tvertex;
vector<T>::iteratoriter;
while(!s.empty())
{
vertex=s.top();
s.pop();
if(this->FindVertex(vertex,*result)==-1)
{
pos=this->GetVertexPos(vertex);
visited[pos]=true;
(*result).push_back(vertex);
adjLst=this->GetNeighbors(vertex);
for(iter=adjLst.begin();iter!=adjLst.end();++iter)
{
if(this->FindVertex(*iter,*result)==-1)
{
s.push(*iter);
}
}
}
}
return*result;
}
template<typenameT>
voidCGraph<T>::ClearVisitFlag()
{
for(inti=0;i<this->numEdges;++i)
{
this->visited[i]=false;
}
}
template<typenameT>
voidCGraph<T>::BreadthFirstSearch()
{
vector<T>::const_iteratoriter;
vector<int>vec;
this->ClearVisitFlag();
vec=this->GraphBreadthFirstSearch();
for(iter=vec.begin();iter!=vec.end();++iter)
{
cout<<*iter<<"";
}
this->ClearVisitFlag();
}

template<typenameT>
vector<T>&CGraph<T>::GraphBreadthFirstSearch()
{//广度遍历
vector<T>*result=newvector<T>();
vector<T>adjLst;
vector<T>::iteratoriter;
queue<T>q;
Titem;
intpos;
this->ClearVisitFlag();
for(inti=0;i<this->numVertexs;++i)
{
if(!this->visited[i])
{
visited[i]=true;
result->push_back(this->vecNodes[i]);

q.push(this->vecNodes[i]);
while(!q.empty())
{
item=q.front();
q.pop();
adjLst=this->GetNeighbors(item);
for(iter=adjLst.begin();iter!=adjLst.end();++iter)
{
if(this->FindVertex(*iter,*result)==-1)
{
result->push_back(*iter);
pos=this->GetVertexPos(*iter);
visited[pos]=true;
}
}
}
}
}
return*result;
}

template<typenameT>
vector<T>&CGraph<T>::GetNeighbors(constT&vertex)
{//获取邻接顶点
vector<T>*result;
result=newvector<T>();
intpos=this->GetVertexPos(vertex);
if(pos==-1)
{
cerr<<"顶点不在图中"<<endl;
return*result;
}
for(inti=0;i<this->numVertexs;++i)
{
if(edge[pos][i]>0)
{
result->push_back(this->vecNodes[i]);
}
}
return*result;
}

template<typenameT>
voidCGraph<T>::DepthFirstSearch()
{
vector<T>::const_iteratoriter,iter2;
intpos;
vector<int>vec1;
this->ClearVisitFlag();
for(iter=this->vecNodes.begin();iter!=this->vecNodes.end();++iter)
{
pos=this->GetVertexPos(*iter);
if(!visited[pos])
{//还未访问，从这点开始
vec1=this->GraphDepthFirstSearch(*iter);
for(iter2=vec1.begin();iter2!=vec1.end();++iter2)
{
cout<<*iter2<<"";
}
}
}
this->ClearVisitFlag();
}

测试程序：

<!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />-->#include"Graph.cpp"
#include<iostream>
usingnamespacestd;


intmain(intargc,char*argv[])
{

CGraph<int>*graph1=newCGraph<int>();
graph1->CreateGraph();
graph1->DepthFirstSearch();
graph1->BreadthFirstSearch();
system("pause");
return0;
}