X1598: Write method isCompleteGraph

Description

Write a method boolean isCompleteGraph(int[][] g) that returns true if the graph is complete. A complete graph is a graph in which every pair of distinct nodes is connected by an edge. Or, said differently, every node in the graph is connected to all other nodes in the graph.

This method takes a parameter, a graph g represented with an adjancency matrix. For this problem, graph 'g' is a undirected graph. Remember the convention is for an edge to be stored in g[row][col], where row represents the source (from) and col the destination (to) of the edge.

Your Answer:

Feedback

Your feedback will appear here when you check your answer.