You will be given a graph. 
There are ‘n’ types of flowers. Each node has a flower of a particular type. Also, each edge has a weight. 
Now you have to go from starting node till the ending node and you need to collect at least one flower of each type. 
Find the shortest path to achieve the given task.