/*

* CC.h

*

* Created on: 2014年6月3日

* Author: zhongchao

* 计算无向图中的连通分量

*/

#ifndef _CC_

#define _CC_

#include "Graph.h"

class CC

{

private:

bool* mark;

int* _id;

int num;

Graph* _graph;

hash_set nodes;

public:

CC(Graph* graph, int n);

~CC();

bool connected(int a, int b); //节点a和b是否在同一连同子图中

int count();

int id(int a); //节点a所属于的连同子图的索引

void dfs(Graph* graph, int n);

void printAllCC();

};

void dfsTest();

#endif /* _CC_*/

/*

* CC.cpp

*

* Created on: 2014年6月3日

* Author: zhongchao

*/

/*

* DFS.cpp

*

* Created on: 2014年6月1日

* Author: zhongchao

*/

#include "CC.h"

CC::CC(Graph* graph, int n): _graph(graph),num(0)

{

mark = new bool[graph->v()];

for(int i = 0; i < graph->v(); i++)

{

mark[i] = false;

}

_id = new int[graph->v()];

hash_set nodes = graph->getNodes();

for(hash_set::iterator it = nodes.begin(); it != nodes.end(); it++)

{

if(mark[*it] != true)

{

dfs(graph, *it);

num++;

}

}

}

void CC::dfs(Graph* graph, int n)

{

mark[n] = true;

_id[n] = num;

vector ns = graph->getEdges(n);

for(vector::iterator it = ns.begin(); it != ns.end(); it++)

{

if(mark[*it] == true) continue;

dfs(graph, *it);

}

}

bool CC::connected(int a, int b)

{

return _id[a] == _id[b];

}

int CC::id(int a)

{

return _id[a];

}

void CC::printAllCC()

{

hash_set nodes = _graph->getNodes();

for(hash_set::iterator it = nodes.begin(); it != nodes.end(); it++)

{

cout<

}

}

int CC::count()

{

return num;

}

CC::~CC()

{

delete[] mark;

}

void ccTest()

{

string path("/home/zhongchao/worksapce/cpp/ComputeAlgorithms/data/tinyG.txt");

Graph* graph = new Graph(path);

int n = 0;

CC* cc = new CC(graph, n);

cc->printAllCC();

}

/*

* Run.cpp

*

* Created on: 2014年5月25日

* Author: zhongchao

*/

#include "Graph.h"

#include "Prim.h"

#include "Dijkstra.h"

#include "DFS.h"

#include "BFS.h"

#include "CC.h"

void bfsTest();

void dfsTest();

void ccTest();

void dfsTopological();

int main(int argc, char** argv)

{

ccTest();

return 1;

}

3 连通子图如下