算法导论-----图（深度优先搜索）

尝试优先策略：只要可能，就在图中尽量深入，深度优先搜索总是对最近才发现的结点v的出发边进行探索，直到该结点的所有出发边都被发现为止。一旦结点v的所有出发边都被发现，搜索则回溯到v的前驱结点，来搜索该前驱结点的出发边。该过程一直持续到从源结点可以达到的所有结点都被发现为止。如果还存在尚未发现的结点，则深度优先搜索将从这些未被发现的结点中任选一个作为新的源结点，重复此过程。

#include <iostream>
using namespace std;


int   time;

typedef enum  Color
{
	GRAY,
	WHITE,
	BLACK
}COLOR;

typedef  struct Node
{
	int    count;         //边的条数
	int    d;             //被发现时间
	int    f;             //搜索完成时间
	int    vertex;        //顶点
	struct Node* p;        //父结点
	COLOR  color;
}NODE,*NODE_POINT;

typedef  struct Graph
{
	int    value;//边的权值
	struct Node* link;
}GRAPH,*GRAPH_POINT;


void DFS_VISIT(GRAPH** graph,NODE_POINT node)
{
	int   j=0;
	time=time+1;
	node->d=time;
	node->color=GRAY;
	for(j=0;j<node->count;++j)
	{
		if(graph[node->vertex-1][j].link->color==WHITE)
		{
			graph[node->vertex-1][j].link->p=node;
			DFS_VISIT(graph,graph[node->vertex-1][j].link);
		}
	}

	node->color=BLACK;
	time=time+1;
	node->f=time;
}

int _tmain(int argc, _TCHAR* argv[])
{
	NODE  node[5];
	int   i;
	GRAPH    **graph;
	graph=(GRAPH**)malloc(5*sizeof(GRAPH*));
	graph[0]=(GRAPH*)malloc(2*sizeof(GRAPH));
	graph[1]=(GRAPH*)malloc(4*sizeof(GRAPH));
	graph[2]=(GRAPH*)malloc(2*sizeof(GRAPH));
	graph[3]=(GRAPH*)malloc(3*sizeof(GRAPH));
	graph[4]=(GRAPH*)malloc(3*sizeof(GRAPH));

	for(i=0;i<5;++i)
	{
		node[i].vertex=i+1;
		node[i].color=WHITE;
		node[i].p=NULL;
	}

	node[0].count=2;
	node[1].count=4;
	node[2].count=2;
	node[3].count=3;
	node[4].count=3;

	graph[0][0].link=&node[1];
	graph[0][1].link=&node[4];

	graph[1][0].link=&node[0];
	graph[1][1].link=&node[4];
	graph[1][2].link=&node[2];
	graph[1][3].link=&node[3];

	graph[2][0].link=&node[1];
	graph[2][1].link=&node[3];

	graph[3][0].link=&node[1];
	graph[3][1].link=&node[4];
	graph[3][2].link=&node[2];

	graph[4][0].link=&node[3];
	graph[4][1].link=&node[0];
	graph[4][2].link=&node[1];

	for(i=0;i<5;++i)
	{
		if(node[i].color==WHITE)
		{
			DFS_VISIT(graph,&node[i]);
		}
	}



    for(i=0;i<5;++i)
	{
		free(graph[i]);
	}
	free(graph);

	system("pause");
	return  0;
}