Given an array edges where each element edges[i] = [ui, vi] represents an edge between nodes ui and vi in an undirected star graph,
Note: A star graph is a graph where one central node is connected to every other node. This implies that a star graph with
nnodes has exactlyn - 1edges.
Constraints:
n
edges.length n - 1 ...
Given an array edges where each element edges[i] = [ui, vi] represents an edge between nodes ui and vi in an undirected star graph,
Note: A star graph is a graph where one central node is connected to every other node. This implies that a star graph with
nnodes has exactlyn - 1edges.
Constraints:
n
edges.length n - 1 ...