GoWorld, a travel agency, organizes customizable tours for traveling enthusiasts worldwide. Travelers can choose the places...

 

Transcribed Image Text:

GoWorld, a travel agency, organizes customizable tours for traveling enthusiasts worldwide. Travelers can choose the places they want to visit, and all the major tourist spots will be covered in the package. Given a tree-like map of the major tourist spots, the starting, and the ending destination. Consider the tourist spots as nodes and the roads connecting the tourist spot as edges. Each edge has a weight associated with it, denoting the distance between nodes. It may be possible that a single edge needs to be traversed more than once. The cost of traversing an edge with weight w for a total of t number of times is defined as w[]x [t/2], where [x] denotes ceil value of x. The overall path cost will be the summation of the cost of traversing an edge for all the edges ie set of edges of the tree, i.e. the summation of all costs for all the edges in the considered path. Given the number of nodes tree_nodes, source node start, the destination node end, and the edge description. The goal is to find the minimum cost path that starts from start and ends at end while visiting all other nodes at least once. Consider the following tree-map below, given start-1 and end-4: 3 3 1 2 2 A GoWorld, a travel agency, organizes customizable tours for traveling enthusiasts worldwide. Travelers can choose the places they want to visit, and all the major tourist spots will be covered in the package. Given a tree-like map of the major tourist spots, the starting, and the ending destination. Consider the tourist spots as nodes and the roads connecting the tourist spot as edges. Each edge has a weight associated with it, denoting the distance between nodes. It may be possible that a single edge needs to be traversed more than once. The cost of traversing an edge with weight w for a total of t number of times is defined as w[]x [t/2], where [x] denotes ceil value of x. The overall path cost will be the summation of the cost of traversing an edge for all the edges ie set of edges of the tree, i.e. the summation of all costs for all the edges in the considered path. Given the number of nodes tree_nodes, source node start, the destination node end, and the edge description. The goal is to find the minimum cost path that starts from start and ends at end while visiting all other nodes at least once. Consider the following tree-map below, given start-1 and end-4: 3 3 1 2 2 A