Code : Is Connected ?
1. V is the number of vertices present in graph G and vertices are numbered from 0 to V-1.
2. E is the number of edges present in graph G.
The first line of input contains two integers, that denote the value of V and E.
Each of the following E lines contains two integers, that denote that there exists an edge between vertex a and b.
The first and only line of output contains "true" if the given graph is connected or "false", otherwise.
0 <= V <= 1000
0 <= E <= (V * (V - 1)) / 2
0 <= a <= V - 1
0 <= b <= V - 1
Time Limit: 1 second
4 4
0 1
0 3
1 2
2 3
true
4 3
0 1
1 3
0 3
false
The graph is not connected, even though vertices 0,1 and 3 are connected to each other but there isn’t any path from vertices 0,1,3 to vertex 2.
#include <iostream>using namespace std;
int main() { // Write your code here}
Comments
Post a Comment