Use edge sets to reimplement the Graph class from Figure 14.3 on page 744. There should be no limit to the number of vertices. Also provide a new method that returns the edge set of a specified vertex.

clone public Graph clone( ) Generate a copy of this Graph. Returns: The return value is a copy of this Graph. Subsequent changes to the copy will not affect the original, nor vice versa. The retum value must be typecast to a Graph before it is used. Throws: OutofMemoryError Indicates insufficient memory for creating the clone. get Label public E getlabel(int vertex) Accessor method to get the label of a vertex of this Graph. Parameter: vertex - a vertex number Precondition: vertex is non-negative and less than size(). Returns: the label of the specified vertex in this Graph Throws: ArrayIndexOutOfBoundsException Indicates that the vertex was not a valid vertex number. neighbors public int[ ] neighbors (int vertex) Accessor method to obtain a list of neighbors of a specified vertex of this Graph. Parameter: vertex a vertex number Precondition: vertex is non-negative and less than size( ). Returns: The retum value is an array that contains all the vertex numbers of vertices that are targets of edges with a source at the specified vertex. Throws: ArrayIndexOutofBoundsException Indicates that the vertex was not a valid vertex number.