Question

2. Design an algorithm to find out the shortest paths from vertex V1 to the others, describe the steps of the algorithm's execution. 12 V2 V5 7 8 8 4 3 V1 V4 V7 11 3 3 9 V3 V6 8 3. A communication system has nine chars c1, c2, c3, c4, c5, c6, c7, c8, c9 and the probability of each char is 5, 22, 3, 9, 10, 11, 28, 4, 8 (1) Draw the Huffman tree for these chars (2) Encode these chars by Huffman code.

          2. Design an algorithm to find out the shortest paths from vertex V1 to the
others, describe the steps of the algorithm's execution.
12
V2
V5
7
8
8
4
3
V1
V4
V7
11
3
3
9
V3
V6
8
3. A communication system has nine chars
c1, c2, c3, c4, c5, c6, c7, c8, c9
and the probability of each char is
5, 22, 3, 9, 10, 11, 28, 4, 8
(1) Draw the Huffman tree for these chars
(2) Encode these chars by Huffman code.

2. Design an algorithm to find out the shortest paths from vertex V1 to the
others, describe the steps of the algorithm's execution.
12
V2
V5
7
8
8
4
3
V1
V4
V7
11
3
3
9
V3
V6
8
3. A communication system has nine chars
c1, c2, c3, c4, c5, c6, c7, c8, c9
and the probability of each char is
5, 22, 3, 9, 10, 11, 28, 4, 8
(1) Draw the Huffman tree for these chars
(2) Encode these chars by Huffman code.

Added by John W.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Robert Fox

Step 1

To find the shortest paths from vertex V1 to the others, we can use Dijkstra's algorithm. Here are the steps of the algorithm's execution: - Create a set of unvisited vertices and initialize it with all vertices except V1. - Create a distance array and initialize Show more…

Show all steps

Thanks for your feedback!

2. Design an algorithm to find out the shortest paths from vertex V1 to the others and describe the steps of the algorithm's execution. 3. A communication system has nine characters: c1, c2, c3, c4, c5, c6, c7, c8, c9. The probability of each character is as follows: 5, 22, 3, 9, 10, 11, 28, 4, 8. 1. Draw the Huffman tree for these characters. 2. Encode these characters using Huffman code.