Clone Graph

Statement

You are given a reference to a single node in an undirected, connected graph. Your task is to create a deep copy of the graph starting from this node. A deep copy means creating a new instance of every node in the graph with the same data and edges as the original graph, such that changes in the copied graph do not affect the original graph.

From the programming perspective, the graph is represented as an adjacency list to understand node relationships. Each node in the adjacency list corresponds to a node in the graph, and the list of neighbors describes that node’s connections. For example, for ...