Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph.
public class Node {
public int val;
public IList<Node> neighbors;
public Node(int _val, IList<Node> _neighbors = null) {
val = _val;
neighbors = _neighbors ?? new List<Node>();
}
}
public Node CloneGraph(Node node) {
// TODO: implement your solution here
return null;
}adjList = [[2,4],[1,3],[2,4],[1,3]][[2,4],[1,3],[2,4],[1,3]]