class Solution {
private:
void init(vector<int>& v)
{
for (int i = 0; i < v.size(); ++i) v[i] = i;
}
int find(vector<int>& fa,int i)
{
return i == fa[i] ? i : fa[i] = find(fa, fa[i]);
}
bool isSame(vector<int>& fa, int u, int v)
{
u = find(fa, u);
v = find(fa, v);
return u == v;
}
void join(vector<int>& fa,int u, int v)
{
u = find(fa,u);
v = find(fa,v);
if (u == v) return;
fa[v] = u;
}
public:
bool validPath(int n, vector<vector<int>>& edges, int source, int destination) {
vector<int> fa(n, 0);
init(fa);
for (int i = 0; i < edges.size(); ++i)
{
join(fa, edges[i][0], edges[i][1]);
}
return isSame(fa, source, destination);
}
};