Added an implementation of a modified version of Dijkstras that was used to find the path with the maximum bottleneck from a start to an end vertex.