Select an appropriate data structure which will be efficient and effective for the purpose of the problem. Please add comments on each line or prepare a "Read me" file for describing your algorithm and for explaining the time complexity of your program.
Problem: Given a snake and ladder board, find the minimum number of dice throws required to reach the destination or last cell from source or 1st cell. Basically, the player has total control over outcome of dice throw and wants to find out minimum number of throws required to reach last cell. If the player reaches a cell which is base of a ladder, the player has to climb up that ladder and if reaches a cell is mouth of the snake, has to go down to the tail of snake without a dice throw.
Example: To reach last cell, you could:
1. throw 3 on the dice and climb the ladder to reach 22
2. then throw 6 on the dice to reach 28 and
3. throw 2 on the dice to reach 30.
i. e.(3,6,2)
Print every possible solution for a minimum number of travels that take the player from the start to the finish.
*** C++ CODE ***