Extend the class of Project P-13.2 to support all the functions of the graph  ADT (including functions for directed edges).

Data from in Project P-13.2

Write a class implementing a simplified graph ADT that has only functions relevant to undirected graphs and does not include update functions using the adjacency matrix structure. Your class should include a constructor that takes two collections (for example, sequences)—a collection V of vertex elements and a collection E of pairs of vertex elements—and produces the graph G that these two collections represent.