图的遍历:深度优先遍历
(1)首先遍历节点0,与0连接的节点有1,2,5,6,那么先遍历节点1,下面再看与节点1相连的是节点0,节点0已经遍历过了,那么继续遍历节点2,与2连接的节点是0,节点0已经遍历过了,那么开始遍历节点5,
(2)与5连接的节点有0,3,4,节点0已经遍历过了,那么开始遍历节点3,3没有被遍历过,记录下3,与节点3连接的节点是4和5,首先4没有被遍历过,记录下4,继续查看与4连接的节点3,5,6,前两个节点3和5都遍历过了,只有节点6没有被遍历过,把6记录下来,
(3)与节点6连接的有节点0和4,这两个都遍历过了,那么就退回到节点4,与节点4连接的三个节点都遍历过了,就继续退回到节点3,查看节点5,节点5已经遍历过了,而且与5连接的0,3,4已经遍历过了,退回到节点0,继续查看节点6,与6连接的节点0和4都遍历过了,遍历结束
使用图遍历可以求连通分量,如下图,一共有3个连通分量
下面是程序实现
#include <iostream>
#include <ctime>
#include <cstdlib>
#include "SparseGraph.h"
#include "DenseGraph.h"
#include "ReadGraph.h"
#include "Component.h"
using namespace std;
int main()
{
string filename1 = "testG1.txt";
SparseGraph g1( 13, false );
ReadGraph<SparseGraph> readGraph1( g1, filename1 );
Component<SparseGraph> component1( g1 );
cout<<"TestG1.txt, Component Count: "<<component1.count()<<endl;
cout<<endl;
string filename2 = "testG2.txt";
DenseGraph g2( 7, false );
ReadGraph<DenseGraph> readGraph2( g2, filename2 );
Component<DenseGraph> component2( g2 );
cout<<"TestG2.txt, Component Count: "<<component2.count()<<endl;
return 0;
}
深度优先遍历Component.h定义为
#include <iostream>
#include <cassert>
using namespace std;
template <typename Graph>
class Component{
private:
Graph &G;
bool *visited;
int ccount;
int *id;
void dfs(int v){
visited[v] = true;
id[v] = ccount;
typename Graph::adjIterator adj(G, v);
for ( int i = adj.begin(); !adj.end(); i = adj.next() ){
if ( !visited[i] )
dfs(i);
}
}
public:
Component(Graph &graph):G(graph){
visited = new bool[G.V()];
id = new int[G.V()];
ccount