Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHPConnected vs Disconnected Graphs
Connected Graph
A graph is connected if any two vertices of the graph are connected by a path.
| Vertex 1 | Vertex 2 | PATH |
|---|---|---|
| a | b | a b |
| a | c | a b c, a c |
| a | d | a b c d, a c d |
| b | c | b a c , b c |
| c | d | c d |
Disconnected Graph
A graph is disconnected if at least two vertices of the graph are not connected by a path. If a graph G is disconnected, then every maximal connected subgraph of G is called a connected component of the graph G.
| Vertex 1 | Vertex 2 | PATH |
|---|---|---|
| a | b | a b |
| a | c | Not Available |
| a | d | Not Available |
| b | c | Not Available |
| c | d | c d |
Updated on: 2019-08-23T07:05:54+05:30
29K+ Views
