tuopu.cpp

C++Example实用的算法:包括枚举

#define UNVISITED 0
#define VISITED 1

void topsort(Graph& G){      //对图的搜索
	for( int i = 0 ; i < G.n() ; i++ )
		G.mark[i] = UNVISITED;     //初始化标记
	for( i = 0 ; i < G.n() ; i++ )    //对每个顶点遍历
		if( G.mark[i] == UNVISITED )
			tophelp( G, i );    //调用辅助函数
}
//辅助函数
void tophelp(Graph& G,int v){
	G.mark[v] == VISITED;      //修改标记
	for( Edge w = G.first(v); G.isEdge(w) ; w = G.next(w) )
		if( G.mark[G.v2(w) == UNVISITED )
			tophelp( G,G.v2(w) );
	printout(v);     //打印结果
}