In Java

Create a matrix based graph representation.

It will need to support the following operations.

Ask the user how many points there are.

Ask the user to label those points, ie "A", "B", "C"...

Define the matrix as a square matrix (2 dimensional array) based on the number of points, also keep an array of the labels.

Repeatedly ask the user to define edges between two points. Add these edges to the matrix.

Have a list method that will list out all of the edges in the graph.

Sample output of how the program should work:

How many vertices? 6 What is the label for vertex 1? A What is the label for vertex 2? B What is the label for vertex 3? C What is the label for vertex 4? D What is the label for vertex 5? E What is the label for vertex 6? F Define an edge by listing a pair of vertices, i.e. "A B", or -1 to stop. A B Added Edge A->B B A Added Edge B->A -1 Your edges are: AB, BA