Create a class which constructs an adjacency matrix representation of a graph and performs a few graph operations.

Please answer in java code.

Write an Adjacency Matrix Graph class which has the following:

Two constructors:

Default which makes the matrix of a pre-defined size

Parameterized which takes in a non-negative or 0 size and creates an empty matrix

addEdge: this method returns nothing and takes in two string parameters and a weight. The two integer parameters correspond to the names of vertices and the weight is the weight of the newly created edge.

printDFS: This prints out the vertices names in depth first order. You can find the algorithm the presentation provided.

printBFS: This prints out the vertices names in breadth first order. Like above you can find the algorithm in the presentation.

printDFSForAll: For every vertex in the graph it will print its DFS

printBFSForAll: For every vertex in the graph it will print its BFS

Write another file that tests each of the methods for this graph.