Chapter 28.3, Problem 28.3.2CP

Explanation of Solution

Edge array of given graph:

int[][] edges = {{0, 1}, {0, 2}, {0, 3}, {0, 4}, {0, 5},{1, 0}, {1, 2}, {1, 3}, {1, 4}, {2, 0}, {2, 1}, {2, 3}, {2, 4},{3, 0}, {3, 1}, {3, 2}, {3, 4}, {3, 5},{4, 0}, {4, 1}, {4, 2}, {4, 3},{5, 0}, {5, 3}}

Explanation:

Here, “int[][]” is the data type of two dimensional array with variable “edges”. The edges values are initialized into an array.

List of edge objects for given graph:

java.util.ArrayList<Edge> list = new java.util.ArrayList<Edge>();

list.add(new Edge(0, 1));

list.add(new Edge(0, 2));

list.add(new Edge(0, 3)); 

list.add(new Edge(0, 4)); 

list.add(new Edge(0, 5)); 

Explanation:

Here, the object “list” for class “ArrayList<>” is initialized with “edge” object. Then the edge values added into list.

Adjacency matrix for given graph:

int[][] adjacencyMatrix = {

  {0, 1, 1, 1, 1, 1}, // node 0

  {1, 0, 1, 1, 1, 0}, // node 1

  {1, 1, 0, 1, 1, 0}, // node 2

  {1, 1, 1, 0, 1, 1}, // node 3

  {1, 1, 1, 1, 0, 0}, // node 4

  {1, 0, 0, 1, 0, 0}  // node 5

};

Explanation:

Here, the variable “adjacencyMatrix” in declared in type of two dimensional integer “int[][]” and the adjacency values are initialized into it.

Adjacency vertex list:

LinkedList<Integer> list[] = new LinkedList<>();

list[0].add(1); list[0].add(2); list[0].add(3); list[0].add(4); list[0].add(5);

list[1].add(0); list[1].add(2); list[1].add(3); list[1].add(4);

list[2].add(0); list[2].add(1); list[2].add(3); list[2]...