Question: C++ Program: Graph Connectivity 1. You are required to implement an application that will find the connectivity of directed and undirected graphs using C++. Your
C++ Program: Graph Connectivity
1. You are required to implement an application that will find the connectivity of directed and undirected graphs using C++. Your application should accept as an input a graph represented using an adjacency matrix. It should return true if the graph is connected and false otherwise. Graphs can be directed or undirected.
2. Test your application with 4 graphs (each of at least 6 vertices): directed connected, directed disconnected, undirected connected and undirected disconnected.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
