Java Programming

1)The number of vertices and edges for two undirected and two directed graphs are given in the following table. Fill in the last column of the table to indicate which representation presented in Figure 9.12 would be the best performing representation for each graph from a time-complexity viewpoint. Assume array expansion is slow.

Figure 9.12

2)Assuming that an undirected, unweighted graph is represented as shown in Figure 9.12a and that operations are performed in the vertex number mode, give the signature and describe the actions of a method that:

a. Deletes an edge from the graph.

b. Deletes a vertex from the graph.

c. Updates an edge in the graph.

3)Repeat the previous exercise assuming the graph is:

a. Directed and unweighted.

b. Undirected and weighted.

Maximum Maximum Best Number of Vertices in the Graph Number of Edges in the Graph Representation Figure 9.12a, 9.12b, or 9.12c Type of Graph Undirected Undirected Directed Directed 10 10 10 unknown 35 16 35 unknowrn Maximum Maximum Best Number of Vertices in the Graph Number of Edges in the Graph Representation Figure 9.12a, 9.12b, or 9.12c Type of Graph Undirected Undirected Directed Directed 10 10 10 unknown 35 16 35 unknowrn