Find If Path Exists In Graph

There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1 (inclusive). The edges in the graph are represented as a 2D integer array edges, where each edges[i] = [ui, vi] denotes a bi-directional edge between vertex ui and vertex vi. Every vertex pair is connected by at most one edge, and no vertex has an edge to itself.

You want to determine if there is a valid path that exists from vertex start to vertex end.

Given edges and the integers n, start, and end, return true if there is a valid path from start to end, or false otherwise.

Example 1:

Input: n = 3, edges = [[0,1],[1,2],[2,0]], start = 0, end = 2
Output: true
Explanation: There are two paths from vertex 0 to vertex 2:
- 0 → 1 → 2
- 0 → 2

Example 2:

Input: n = 6, edges = [[0,1],[0,2],[3,5],[5,4],[4,3]], start = 0, end = 5
Output: false
Explanation: There is no path from vertex 0 to vertex 5.

Constraints:

• 1 <= n <= 2 * 105
• 0 <= edges.length <= 2 * 105
• edges[i].length == 2
• 0 <= ui, vi <= n - 1
• ui != vi
• 0 <= start, end <= n - 1
• There are no duplicate edges.
• There are no self edges.

思路：题目大意是根据给出的边，判断一个顶点是否能到达另一个顶点。用了并查集来实现

//找到节点index的根节点
int Find(vector<int>&parent,int index){
    if(parent[index]!=index){
        parent[index]=Find(parent,parent[index]);
    }
    return parent[index];
}

//让index1集合的根节点指向index2集合的根节点
void Union(vector<int>& parent,int index1,int index2){
    parent[Find(parent,index1)]=Find(parent,index2);
}

bool validPath(int n, vector<vector<int>>& edges, int start, int end) {
    vector<int>parent(n+1);
    //每个顶点的初始集合，只有本身
    for(int i=1;i<=n;i++){
        parent[i]=i;
    }

    for(auto &edge:edges){
        int ver1=edge[0],ver2=edge[1];
        //如果这两个顶点不在同一个集合，就合并到同一个集合里
        if(Find(parent,ver1)!=Find(parent,ver2)){
            Union(parent,ver1,ver2);
        }
    }

    return Find(parent,start)==Find(parent,end);
}