In-class Assignment 6

1. Write a program that implements an adjacency matrix for an undirected and unweighted graph. In order to implement the adjacency matrix, please implement the below first.

   struct Edge;
      //Purpose: Abstract structure for graph edges.
   
   int insertEdge(Edge e);
      //Purpose: Store an edge defined by two vertices.
   

   Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2), (1,4), (2,1), (2,3), (3,2), (4,1)}.

2. Write a program that implements an adjacency list for an undirected and unweighted graph.

   Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2), (1,4), (2,1), (2,3), (3,2), (4,1)}.