[Solved]G Assume Graph G N 5 Nodes N Vertices Represented N N Adjacency Matrix 0 1 Matrix Const In Q37171033

Solve using java language.

G: Assume you have a graph G of n-5 nodes (n vertices) represented by n’n adjacency matrix (0/1 matrix) const int n 5; int AniIn: Write the method int CountEdges(ADD) that returns the number of edges in the graph G. (1 Point) Qz: Write the method IsConnected(i,j) that returns true if the vertex i is connected with the vertex j. It returns false otherwise. (1 Point) Qs: Write the method Disconnectvertices(ij) that disconnect the vertices i and j. We assume they are connected (1 Point) Q4: Write the method IsDirected(ADD) that returns true if the graph G has directions (directed graph). It returns false otherwise. (Point) Qs: Show how the graph G can be represented using a linked list (1 Point) Show transcribed image text G: Assume you have a graph G of n-5 nodes (n vertices) represented by n’n adjacency matrix (0/1 matrix) const int n 5; int AniIn: Write the method int CountEdges(ADD) that returns the number of edges in the graph G. (1 Point) Qz: Write the method IsConnected(i,j) that returns true if the vertex i is connected with the vertex j. It returns false otherwise. (1 Point) Qs: Write the method Disconnectvertices(ij) that disconnect the vertices i and j. We assume they are connected (1 Point) Q4: Write the method IsDirected(ADD) that returns true if the graph G has directions (directed graph). It returns false otherwise. (Point) Qs: Show how the graph G can be represented using a linked list (1 Point)

Expert Answer

---

Answer to G: Assume you have a graph G of n-5 nodes (n vertices) represented by n’n adjacency matrix (0/1 matrix) const int n 5; i… . . .