C++ Directed Graph Question

Consider the above directed weighted graph and represent the graph using an adjacency matrix. While creating the adjacency matrix, use the state names in alphabetical orders. Instead of using the whole names (e.g. New York), use the first letters (e.g. N) of the states to identify them. Format of adjacency matrix will be (the first row is done for you): Create a menu driven application which will provide the following options to the users: This option will allow users to add an edge to the existing graph model. To add an edge, take two vertices (the edge is from first to second) and the edge weight as input from the user, update the adjacency matrix using that two vertices as index. If an edge already exists, notify the user by saying ''edge already exists!" This option will allow users to delete an edge to the existing graph model. To delete an edge, take two vertices as input from the user, update the adjacency matrix using that two vertices as index. If there is no existing edge, notify the user by saying "no edge available!" Show total number of edges: Show total number of edges using the adjacency matrix. Show the matrix: Show the updated adjacency matrix in the console. Exit