# Is Graph Connected

easy

1. You are given a graph. 2. You are required to find and print if the graph is connected (there is a path from every vertex to every other).

## Constraints

None

## Format

### Input

Input has been managed for you

### Output

true if the graph is connected, false otherwise

## Example

Sample Input

7
5
0 1 10
2 3 10
4 5 10
5 6 10
4 6 10

### Sample Output

false

Question Video