Write a code to find if a given graph is a connected graph or not.
A connected graph is a graph having every node connected to every other node.
Implement a BFS traversal to travel to every node to check if it is connected to every other node or not.
Write a code to find if a given graph is a connected graph or not. A connected graph is a graph having every node connected to every other node. Implement a BFS traversal to travel to every node to check if it is connected to every other node or not.