This file includes a heuristic to solve the problem of shortest path between two given vertices of a graph, with a limited amount of max length allowed before passing through a vertex of a special set.