Help me finish this code please..
Write a simple graph implementation (Graph.java) that uses an adjacency matrix to represent a weighted, directed graph. Include a constructor that takes the number of vertices and instantiates the matrix accordingly. Also, fill the matrix with a sentinel value for edges that do not exist. Write methods to add and remove edges, as well as a toString() method to neatly display the graph. When adding edges, make sure that an edge from n to m is in row n and column m.

Write a driver program to test your graph (GraphTest.java). Create a graph with n nod

Question

Help me finish this code please..
Write a simple graph implementation (Graph.java) that uses an adjacency matrix to represent a weighted, directed graph. Include a constructor that takes the number of vertices and instantiates the matrix accordingly. Also, fill the matrix with a sentinel value for edges that do not exist. Write methods to add and remove edges, as well as a toString() method to neatly display the graph. When adding edges, make sure that an edge from n to m is in row n and column m.   

 

Write a driver program to test your graph (GraphTest.java). Create a graph with n nod

e.mccormick · Answer

Do you know what an adjacency matrix is?

e.mccormick · Answer

http://mathworld.wolfram.com/AdjacencyMatrix.html

anonymous · Answer

well not to familiar with it