The input consists of a graph and time bound constraints on traversing the edges of the graphs, the goal is to reach one of the destinations from a given source node, if possible. The solution is implemented using DFS, BFS and Uniform cost search strategies in Python