No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
import java.util.ArrayList; import java.io.*; import java.util.*; import java.util.Graph; public class Graph { public int[][] adjMatrix;//Edges will be represented as adjacency Matrix int size; } public Graph(int size) { adjMat = new boolean[size][size]; for (int i=0; i < adjMat.length; i++) { for (int j=0; j < adjMat.length; j++) { adjMat[i][j] = … 
|
|
|
public class Graph { boolean[][] adjMat; // In the adjacency matrix representation of a Graph, // if adjMat[i][j] == true, then you can move from // node i to node j. // i.e. j is a neighbour of i. // The constructor builds the adjacency matrix, // with initially all … 
|