Solution: Redundant Connection
Understand how to apply the union find pattern to detect a redundant connection in an undirected graph. Learn step-by-step implementation details including union by rank and path compression to efficiently find and remove the edge creating a cycle.
Statement
We’re given an undirected graph consisting of nodes. The graph is represented as an array called edges, of length , where edges[i] = [a, b] indicates that there is an edge between nodes a and b in the graph.
Return an edge that can be removed to make the graph a edges.
Constraints:
edges.length