#1971. Find if Path Exists in Graph

if (src === dest)
return true;

for (let neighbor of graph[src]) {
if (!visited[neighbor]) {
if (hasPath(graph, neighbor, dest, visited))
return true;
}
}

return false;
}

function validPath(n, edges, start, end) {
const graph = Array.from({ length: n }, () => []);

for (let [u, v] of edges) {
graph[u].push(v);
graph[v].push(u);
}

const visited = Array(n).fill(false);

return hasPath(graph, start, end, visited);
}