Clone an undirected graph. Each node in the graph contains a
label and a list of its
OJ’s undirected graph serialization:
Nodes are labeled uniquely.
# as a separator for each node, and
, as a separator for node label and each neighbor of the node.
As an example, consider the serialized graph
The graph has a total of three nodes, and therefore contains three parts as separated by
- First node is labeled as
0. Connect node
0to both nodes
- Second node is labeled as
1. Connect node
- Third node is labeled as
2. Connect node
2(itself), thus forming a self-cycle.
Visually, the graph looks like the following: