Meet the concept↗
A connected graph is an undirected graph in which there exists a path between every pair of vertices. If even one pair of vertices is not connected by a path, the graph is called disconnected.
Conditions: The graph is undirected.; The criterion for judgment is whether a path exists between any two vertices.
0:24 – 1:17Watch this moment ↗
A connected graph is an undirected graph in which there exists a path between every pair of vertices. If even one pair of vertices is not connected by a path, the graph is called disconnected.
Conditions: The graph is undirected.; The criterion for judgment is whether a path exists between any two vertices.
0:24 – 1:17Watch this moment ↗