problem1. It is probable to define more operations for a Graph ADT. Illustrate two operations which you think would be useful additions to WeightedGraphInterface.
problem2. Class WeightedGraph in this chapter is to be extended to comprise a removeVertex operation, which eradicates a vertex from the graph. Deleting a vertex is more complicated than deleting an edge from graph. Discuss the reasons for this operationsâ€™ greater difficulty.
problem3. Our shortestPaths method is concerned with the minimum distance between two vertices of a graph. Make a minEdges technique which returns the minimum number of edges which exist on a path between two given vertices. You can put your new technique in our useGraph class in the textbook and use it to test your code.