Class Solution
-
- All Implemented Interfaces:
public final class Solution
2685 - Count the Number of Complete Components.
Medium
You are given an integer
n
. There is an undirected graph withn
vertices, numbered from0
ton - 1
. You are given a 2D integer arrayedges
where <code>edgesi = a<sub>i</sub>, b<sub>i</sub></code> denotes that there exists an undirected edge connecting vertices <code>a<sub>i</sub></code> and <code>b<sub>i</sub></code>.Return the number of complete connected components of the graph.
A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph.
A connected component is said to be complete if there exists an edge between every pair of its vertices.
Example 1:
Input: n = 6, edges = [0,1,0,2,1,2,3,4]
Output: 3
Explanation: From the picture above, one can see that all of the components of this graph are complete.
Example 2:
Input: n = 6, edges = [0,1,0,2,1,2,3,4,3,5]
Output: 1
Explanation: The component containing vertices 0, 1, and 2 is complete since there is an edge between every pair of two vertices. On the other hand, the component containing vertices 3, 4, and 5 is not complete since there is no edge between vertices 4 and 5. Thus, the number of complete components in this graph is 1.
Constraints:
1 <= n <= 50
0 <= edges.length <= n * (n - 1) / 2
edges[i].length == 2
<code>0 <= a<sub>i</sub>, b<sub>i</sub><= n - 1</code>
<code>a<sub>i</sub> != b<sub>i</sub></code>
There are no repeated edges.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Integer
countCompleteComponents(Integer n, Array<IntArray> edges)
-
-
Method Detail
-
countCompleteComponents
final Integer countCompleteComponents(Integer n, Array<IntArray> edges)
-
-
-
-