An implementation of the depth first search algorithm to find the optimal path in a graph. The graph contains information about the streets that a person has to cross, with weights and a low-high traffic value, while he is aiming to reach his destination as soon as possible.