Given the following Graph class structure, enter the adjacency-list for each of the vertices in the...

Transcribed Image Text:

Given the following Graph class structure, enter the adjacency-list for each of the vertices in the image based on the order of input edges provided (left side of image). For each adjacency-list, use this format exactly: x, y, z and enter NULL for an empty list; 84 2 3 1 11 06 36 10 3 7 11 78 11 8 20 62 52 5 10 5 0 8 1 4 1 0 5 2 10 6 3 7 11 8 1 9 4 public class Graph { } private final int V; // number of vertices private int E; // number of edges private Bag<Integer>[] adj; // adjacency lists public Graph(int V) { } public int V() { return V; } public int E() { return E; } public Iterable<Integer > adj(int v) { return adj[v]; } public void add Edge(int v, int w) { } adj[v]. add (w); // Add w to v's list. adj[w].add(v); // Add v to w's list. E++; > 1 2 3 4 5 6 7 8 9 10 11 A/ N A A/ A/ 신 A Given the following Graph class structure, enter the adjacency-list for each of the vertices in the image based on the order of input edges provided (left side of image). For each adjacency-list, use this format exactly: x, y, z and enter NULL for an empty list; 84 2 3 1 11 06 36 10 3 7 11 78 11 8 20 62 52 5 10 5 0 8 1 4 1 0 5 2 10 6 3 7 11 8 1 9 4 public class Graph { } private final int V; // number of vertices private int E; // number of edges private Bag<Integer>[] adj; // adjacency lists public Graph(int V) { } public int V() { return V; } public int E() { return E; } public Iterable<Integer > adj(int v) { return adj[v]; } public void add Edge(int v, int w) { } adj[v]. add (w); // Add w to v's list. adj[w].add(v); // Add v to w's list. E++; > 1 2 3 4 5 6 7 8 9 10 11 A/ N A A/ A/ 신 A