[Solved]Ds 9 Graphs 1 Write Program Implements Adjacency Matrix Undirected Unweighted Graph Struct Q37297988

c++

ds-on 9: Graphs an 1. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Edge f int vertexl; Int vertex2; Implement the following functions a. void insertEdge (Edge e, int adjMat [4] [4]) a. //Purpose: Store an edge defined by two vertices. b. void printGraph (int adjMat [4] [4]) a. //prints the edges included in an adjacency matrix c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2). 2. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Node { int Vertex; Node* next; Implement the following functions a. void printList (Node adjList [4]) b. //prints the vertices included in //an adjacency list c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges (1,2), Show transcribed image text ds-on 9: Graphs an 1. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Edge f int vertexl; Int vertex2; Implement the following functions a. void insertEdge (Edge e, int adjMat [4] [4]) a. //Purpose: Store an edge defined by two vertices. b. void printGraph (int adjMat [4] [4]) a. //prints the edges included in an adjacency matrix c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2). 2. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Node { int Vertex; Node* next; Implement the following functions a. void printList (Node adjList [4]) b. //prints the vertices included in //an adjacency list c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges (1,2),

Expert Answer

---

Answer to ds-on 9: Graphs an 1. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct… . . .