Discuss the below:
Graph 1
A B C D E F G
A 0 0 1 1 0 1 0
B 0 0 0 1 1 0 0
C 1 0 0 0 0 1 0
D 1 1 0 0 1 1 0
E 0 1 0 1 0 0 0
F 1 0 1 1 0 0 1
G 0 0 0 0 0 1 0
Graph 2
A B C D E F G
A 0 0 0 1 0 1 1
B 0 0 0 1 1 0 0
C 0 0 0 0 0 0 0
D 1 1 0 0 1 1 0
E 0 1 0 1 0 0 0
F 1 0 0 1 0 0 1
G 1 0 0 0 0 1 0
(1) Determine if the graph is connected
(2) Find a minimal spanning tree of the connected portions of the graph.
Display both graphs, then I need to display which portions of the 2 graphs are "connected" or the same. The areas that are the same need to be put into a minimal spanning tree.
This program would need to be used in visual studio using C++ programming language.