Chapter 28.4, Problem 28.4.1CP

Explanation of Solution

“Graph”:

In Java, a “Graph” is an interface contains all basic operations in a graph using methods. The methods of the interface “Graph” are discussed below:

• “getSize()”: It returns an “int” value that indicates the number of vertices in the graph.
• “getVertices()” : It returns the list, contains vertices in a graph.
• “getVertex(int)” : It returns an object, which indicates the specified vertex index.
• “getNeighboys(int)” : It returns the list of integer that indicated the neighbor of vertex with the particular index.
• “getDegree(int)” : It returns an “int” value that indicates degree of the specified vertex index.
• “printEdges()” : It display the edges.
• “clear()” : It clears the graph.
• “addVertex(V)” : It return a Boolean value “true”, if “V” is added in a graph. Else, it returns “false”.
• “addEdge(int u,int v)” : It return a Boolean value “true”, if the edge “u,v” is added in a graph. Else, it returns “false”.
• “addEdge(E)” : It return a Boolean value “true”, if the edge e is added into the adjacency edge list...