Question

Q.3. i) Use Dijkstra's algorithm to find the length of a shortest path between the vertices a and z in
the given weighted graph
b
d
5
5
4
7
2
3
I
2
M
4
Ć
6
5.
ii) Use Huffman coding to encode these symbols with given frequencies:
a: 0.20, b: 0.10,c: 0.15, d: 0.25, e: 0.30.​

Answer 1

Answer:

ryxxfgfftgdyvdtvxtgdyvdtgfxbjttfjufdrgf

Step-by-step explanation:

ccfggfggv

KGDUFFYFTTTFFFFF yfrrddcvhutdxxcvvbnjuuyrrdxcvvjutrdxcb