How do I implemented the following question using Java?

Take a graph as an input from the user. You can use arrays, stacks or queues for the input. Take edges and their endpoints as an input from the user. Perform the following tasks: Create the Edge Endpoint function of the graph .Calculate and print the degree of all the vertices. . Determine if the graph has any isolated vertex . Create the Adjacency Matrix of the graph Calculate the total degree of the graph Determine if the graph is a simple graph or not