MyJuliaPackage

Creates our own graph instance so that we don't have to recompute things so many times. :)

Base case for the recursion explorer. Checks just the best distance/duration in the set of streets we haven't traversed. :)

Explores arbitrary depth of the graph using recursion. Sums distance/duration to get the best overall speed. :)

Greedy search approach to returning Solution. Uses depth forward search to determine a greedy choice. :)

Returns the neighboring (end, duration, distance) tuple with the lowest duration. :)

Returns the total distance of an array of itineraries