DFS生成森林代码

DFS生成森林代码

typedef char TElemType;

typedef struct CSNode{
	TElemType data;
	CSNode *firstChild, *nextSibling;
}CSNode,*CSTree; 

void DFSForest(Graph G,CSTree &T)
{
	T = NULL; //生成森林的根 
	bool visited[MAXSIZE]; //标记 
	for(int i = 0; i < G.vexnum; i++)
		visited[i] = false;
	CSNode pre; //保存前一个兄弟 
	for(int v = 0; v < G.vexnum; v++)
	{
		if(!visited[v])
		{
			CSNode* p = (CSNode*)malloc(sizeof(CSNode)); //创建结点 
			*p = {getValue(G,v), NULL, NULL}; //赋值 
			if(!T) T = p;   //v是生成森林的第一棵子树 
			else pre->nextSibling = p;  //后一棵树做前棵的兄弟 
			pre = p;  //第一次后赋值 
			DFSTree(G, v, p);  //以p为根创建其子树 
		}
	} 
}

void DFSTree(Graph G, int v, CSTree &T)
{
	visited[v] = true;
	bool first = true; //标记是否第一个兄弟 
	CSNode *pre;
	for(int w = FirstNeighbor(G, v); w >= 0; w = NextNeighbor(G, v, w))
	{
		if(!visited[w])
		{
			CSNode *p = (CSNode*)malloc(sizeof(CSNode));
			*p = {getValue(G,w), NULL, NULL};
			if(first)
			{
				T->firstChild = p; first = false; 
			}
			else pre->nextSibling = p;
			pre = p;
			DFSTree(G,w,p);
		}
	}
}