MyJuliaPackage
Documentation for MyJuliaPackage.
MyJuliaPackage.create_graphMyJuliaPackage.explorer_1dMyJuliaPackage.explorer_ndMyJuliaPackage.gredMyJuliaPackage.lowest_dur_neighborMyJuliaPackage.total_distance
MyJuliaPackage.create_graph — MethodCreates our own graph instance so that we don't have to recompute things so many times. :)
MyJuliaPackage.explorer_1d — MethodBase case for the recursion explorer. Checks just the best distance/duration in the set of streets we haven't traversed. :)
MyJuliaPackage.explorer_nd — MethodExplores arbitrary depth of the graph using recursion. Sums distance/duration to get the best overall speed. :)
MyJuliaPackage.gred — MethodGreedy search approach to returning Solution. Uses depth forward search to determine a greedy choice. :)
MyJuliaPackage.lowest_dur_neighbor — MethodReturns the neighboring (end, duration, distance) tuple with the lowest duration. :)
MyJuliaPackage.total_distance — MethodReturns the total distance of an array of itineraries