最新下载
热门教程
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
C++邻接表实现无向图实例代码
时间:2015-02-01 编辑:简简单单 来源:一聚教程网
用向量来存储一条邻接链表,存储可连通值。实现了判断是否连通,添加边,添加顶点的功能。
UnDirectGraph.h
#pragma once
include “stdafx.h”
include
using namespace std;
class UnDirectGraph
{
private:
int vCount;
vector
public:
int GetVCount();
UnDirectGraph(int vCount);
void AddEdge(int v,int w);
vector
bool IsConnected(int v,int w);
};
UnDirectGraph.cpp
#pragma once
include “stdafx.h”
include “UnDirectGraph.h”
using namespace std;
UnDirectGraph::UnDirectGraph(int _vCount)
{
this->vCount=_vCount;
adj=new vector
for (int i=0;i<vCount;i++)
{
adj[i].clear();
}
}
void UnDirectGraph::AddEdge(int v,int w)
{
adj[v].push_back(w);
adj[w].push_back(v);
}
vector
{
return adj[v];
}
bool UnDirectGraph::IsConnected(int v,int w)
{
for (vector
{
if (*iter==w)
{
return true;
}
}
return false;
}
int UnDirectGraph::GetVCount()
{
return vCount;
}
代码还算清晰,就不解释了,相信学习C++的同学都看得懂。
相关文章
- C++ MD5的源码实例详解 01-19
- 用C++与Java代码实现KMP算法实例 10-31
- 实例分析c++拷贝初始化与直接初始化的底层区别 10-31
- c/c++扩展python实例学习教程 08-08
- C++中 set,multiset,map,multimap 关联容器实例教程 08-04
- 超详细的C++指针介绍及实例教程 04-17