You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
OJ's undirected graph serialization:
Nodes are labeled uniquely.
We use # 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 {0,1,2#1,2#2,2}.
The graph has a total of three nodes, and therefore contains three parts as separated by #.
First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
Second node is labeled as 1. Connect node 1 to node 2.
Third node is labeled as 2. Connect node 2 to node 2 (itself), thus forming a self-cycle.
Visually, the graph looks like the following:
1
/ \
/ \
0 --- 2
/ \
\_/
Question:
Give you an undirected graph like above, print a string like 0,1,2#1,2#2,2.
Another example: 0,1,5#1,2,5#2,3#3,4,4#4,5,5#5, check this.
The text was updated successfully, but these errors were encountered:
Question:
Give you an undirected graph like above, print a string like
0,1,2#1,2#2,2
.Another example:
0,1,5#1,2,5#2,3#3,4,4#4,5,5#5
, check this.The text was updated successfully, but these errors were encountered: