Determine if an input undirected graph is a connected graph. A graph is connected if
there is a path of edges between any pair of vertices in the graph. The graph edges are
entered at the command line. The graph vertices are only those derived from the input
edges. Results are displayed on the console.
2. Each input transaction represents an undirected edge of a graph. The edge consists of
two unequal non-negative integers in the range 0 to 99 representing graph vertices that
the edge connects. The two integers on each input transaction are separated by space.
An input transaction containing the string “end-of-file” signals the end of the graph edge
input. After the edge information is read, the connection detection process begins.
Represent the graph using an adjacency matrix. Use a queue data structure when
traversing the graph. The input data is assumed to be valid, so is no need to perform data
validation on the input data.