Problem
Write Digraph methods called read that will read from the terminal the number of vertices in an undirected graph and lists of adjacent vertices. Be sure to include error checking. The graph is to be implemented with
(a) an adjacency table;
(b) a linked vertex list with linked adjacency lists;
(c) a contiguous vertex list of linked adjacency lists.