深搜判断结点i和结点j之间存在路径

 

int visited[MAXSIZE]={0};
int Exist_Path_DFS(ALGraph G,int i,int j){
	int p;
	if(i==j) return 1;
	else{
		visited[i]=1;
		for(p=FirstNeighbor(G,i);p>=0;p=NextNeighbor(G,i,p)){
			if(!visited[p]&&Exist_Path_DFS(G,p,j)){
				return 1;
			}
		}
	}
	return 0;
}