We were given this exercise in which we are to implement pathfinding with directed graphs.
The goal is to go from start -> mid -> end with the fastest possible
