Too Long; Didn't Read
Task description: Given a reference of a node in a connected(https://en.wikipedia.org/wiki/Connectivity)Connected_graph) Return a deep copy of the graph. Each node in the graph contains a value (`int`) and a list (`ListNode`) of its neighbors. The graph is represented in the test case using an adjacency list. The given node will always be the first node with `val = 1` You must return the copy of a given node as a reference to the cloned graph.