C++ Please

“Submission deadline! Wendesday, December 4 at 16.00 rces Assignment: This week, we are going to implement an undirected graph. ation Usually, we can use the adjacency matrix to implement a graph. Represent a vertex by using the index value. Today, we are going to play with a graph with 6 vertices, so the vertices are 0, 1, 2, 3, 4 and 5. Start the program by creating a graph with no edges (all-zero adjacency matrix). Then you are going to implement the following functions: 0) Create null adjacency matrix (20 points) 1) Insert an edge (20 points) 2) Delete an edge (20 points) 3) Print Adjacency Matrix (20 points) 4) Check adjacency of two vertices (20 points) Given the graph, You are going to test them by: 1) Create the adjacency matrix by adding edges one by one 2) Delete the edge (1, 4) 3) Print the revised adjacency matrix 4) Check if vertices 1 and 4 are connected, as well as vertices 0 and 3. Show transcribed image text “Submission deadline! Wendesday, December 4 at 16.00 rces Assignment: This week, we are going to implement an undirected graph. ation Usually, we can use the adjacency matrix to implement a graph. Represent a vertex by using the index value. Today, we are going to play with a graph with 6 vertices, so the vertices are 0, 1, 2, 3, 4 and 5. Start the program by creating a graph with no edges (all-zero adjacency matrix). Then you are going to implement the following functions: 0) Create null adjacency matrix (20 points) 1) Insert an edge (20 points) 2) Delete an edge (20 points) 3) Print Adjacency Matrix (20 points) 4) Check adjacency of two vertices (20 points) Given the graph, You are going to test them by: 1) Create the adjacency matrix by adding edges one by one 2) Delete the edge (1, 4) 3) Print the revised adjacency matrix 4) Check if vertices 1 and 4 are connected, as well as vertices 0 and 3.

## Expert Answer

Answer to “Submission deadline! Wendesday, December 4 at 16.00 rces Assignment: This week, we are going to implement an undirected…