So I have a functioning critical path algorithm, how it works is; it will calculate the cost of each element, and then create a sequence which will print out the quickest pa
