Question:
Graph and describe adjacency matrix
Assume that a graph uses and adjacency matrix to represent the edges. Describe how you would update the matrix for the following algorithms.
(a). Insert an edge
(b). Insert a new vertex
(c). Delete and edge
(d). Delete a vertex.