6-3 两顶点之前有路径吗？ (20 分)

/*
    这个题很简单，就是B题的一种变形，直接把B题的代码copy过来，然后改一下变量就过了
*/

int hasPath(struct Graph *g, int v, int w)
{
    int vm = 0;
    
    int q[1000];
    int front = -1, rear = -1;
    q[++rear] = v;
    
    int flag = 0;
    
    while(front!=rear)
    {
    	int top = q[++front];
    	visited[top] = 1;
    	vm++;
    	for(int i = 0;i < g->v;i++)
    	{
    		if(g->Adj[i][top] == 1)
			{
    			if(!visited[i])
				{
    				visited[i] = 1;
    				q[++rear] = i;
				}
			}
		}
	}
	
	if(visited[w] == 1) {
		flag = 1;
		printf("%d\n",vm);
		printf("%d\n",vm);
		return flag;
	}else{
		printf("%d\n",vm);
	}
	
	int qq[1000];
	front = -1, rear = -1;
	int wm = 0;
	qq[++rear] = w;
	
	while(front!=rear)
    {
    	int top = qq[++front];
    	visited[top] = 1;
    	wm++;
    	for(int i = 0;i < g->v;i++)
    	{
    		if(g->Adj[i][top] == 1){
    			if(!visited[i])
				{
    				visited[i] = 1;
    				qq[++rear] = i;
				}
			}
		}
	}
	printf("%d\n",wm);
	
	return 0;
}