Class Solution
java.lang.Object
g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable.Solution
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionintfind(int x, int[] arr) intmaxNumEdgesToRemove(int n, int[][] edges) booleanunion(int x, int y, int[] arr, int[] rank)
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
maxNumEdgesToRemove
public int maxNumEdgesToRemove(int n, int[][] edges) -
union
public boolean union(int x, int y, int[] arr, int[] rank) -
find
public int find(int x, int[] arr)
-