【LintCode】在无向图中找出各极大连通子图 Find the Connected Component in the Undirected Graph

最新推荐文章于 2025-03-15 22:33:59 发布

wutingyehe

最新推荐文章于 2025-03-15 22:33:59 发布

阅读量3.1k

点赞数

本文链接：https://blog.youkuaiyun.com/wutingyehe/article/details/47702499

版权

在给定的无向图中，每个节点包含标签和邻居列表。该图有两个不相连的子图{A,B,D}和{C,E}，即两个连通分量。" 129485838,17792442,800V超充技术与新能源汽车电驱系统测试挑战,"['汽车技术', '新能源汽车', '电驱系统', '电力电子', '测试方案']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Find the number connected component in the undirected graph. Each node in the graph contains a label and a list of its neighbors. (a connected component (or just component) of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph.)
（lintcode上这道题的翻译有点问题。）

Example
Given graph:
这里写图片描述
Return {A,B,D}, {C,E}. Since there are two connected component which is {A,B,D}, {C,E}

//广度优先搜索
/**
 * Definition for Undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     ArrayList<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { 
 *      label = x; 
 *      neighbors = new ArrayList<UndirectedGraphNode&g