Exercise: Degree Sequence and Adjacency List in Java

Given the following undirected graph with nine vertices and thirteen edges:

Vertices: $\{$A$,$ B$,$ C$,$ D$,$ E$,$ F$,$ G$,$ H$,$ I$\}$

Edges: $\{($A$,$ B$),($A$,$ C$),($B$,$ D$),($B$,$ E$),($C$,$ F$),($C$,$ G$),($D$,$ E$),($D$,$ H$),($E$,$ I$),($F$,$ G$),($G$,$ H$),($H$,$ I$),($I$,$ F$)\}$

The following is requested to be implemented in a Java program:

Represent this graph using an appropriate data structure.

Calculate the degree sequence of the graph's vertices.

Generate the adjacency list of the graph.

Considerations

Use a class called Grafo to represent the graph and perform the calculations.

Implement methods in the Grafo class to add edges, calculate the degree sequence, and generate the adjacency list.

Create a main method to test your implementation. Add the provided edges and display the degree sequence and adjacency list in the console.

Additional Resources

You can use the HashMap, ArrayList, or any other data structure you consider appropriate to store the graph information.