1. Let G be a graph whose vertices are the integers 1 through 8 and let the adjacent vertices of each vertex be given by the table. Assume that, in a traversal of G, the adjacent vertices of a given vertex are returned in the same order as they are listed in the table below. Vertex Adjacent vertices 1 2,3,4 2 1,3,4 3 1,2,4 4 1,2,3,6 5 6,7,8 6 4,5,7 7 5,6,8 8 5,7 Assume that, in a traversal of G, the adjacent vertices of a given vertex are returned in the same order as they are listed in the above table. a. Draw G. b. Order the vertices as they are visited in a DFS traversal starting at vertex 1. c. Order the vertices as they are visited in a BFS traversal starting at vertex 1. 2. A file contains only colons, spaces, newlines, commas, and digits in the following frequency: colon (100), space (605), newline (100), comma (705), 0 (431), 1 (242), 2 (176), 3 (59), 4 (185), 5 (250), 6 (174), 7 (199), 8 (205), 9 (217). Construct the Huffman tree and Huffman code. Show your work in details.
The post Construct the Huffman tree and Huffman code. appeared first on My Assignment Online.