It is a DSA problem for ecnryption and decryption. Enter a text to create a Huffman tree which is then used to encode the input text file. Then you can use the decryption key to decode the encoded file.
Given a graph with nodes representing cities and vertices representing road or air routes, goal is to find the minimal path for the traveler to reach his destination using BFS traversal.