adjacency matrix c++

[sanjeevron]

Define a class for an adjacency matrix representation of weighted, directed graphs in C++.
2. Implement the following essential methods in your class. Any input validation or exceptions
must be handled within the methods.
• addNode - adds a new node (vertex) to the graph
• deleteNode(i) - deletes a given node, i from the graph
• addEdge(i,j,w) - adds an edge from node i to node j with weight w
• deleteEdge(i,j) - deletes the edge from node i to node j
• countNodes - returns the number of nodes in the graph
• countEdges - returns the number of edges in the graph
• displayGraph - displays the adjacency matrix for the graph
• displayShortestPathLengths - displays a matrix that contains the lengths of the shortest path
between all pairs of nodes in the graph
• displayShortestPath(i,j) - displays the sequence of nodes that form the shortest path from
node i to node j
3. Write a client (main program) to test your class. The client should display a menu to the user as
described below.
a) One of the options in the menu should be “Read Graph” which would allow the client to
read an adjacency matrix representation of a graph directly from a text file. The format of
the text file to be read is given below. Note: The first line in the text file has the number of
nodes (vertices) and the rest of the data is the adjacency matrix indicating the weights on
the edges between all pairs of nodes in the graph (-1 is used to represent “no edge”).

[weaknessforcats]

Is there a question here?

[kaioshin00]

Read the policy about homeworks

To get started on this, remember that an adjacency matrix is a 2D array that contains a 1 (or a weight) if node[u][v] is an edge and a 0 if node[u][v] is not have an edge.