GitHub - preetpatel/Greedy-Path-Mapping: Best Greedy Path finds the best path moving from the western edge to the eastern edge

preetpatel / Greedy-Path-Mapping Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Best Greedy Path finds the best path moving from the western edge to the eastern edge

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
BestGreedyPath.m		BestGreedyPath.m
BestGreedyPathHeadingEast.m		BestGreedyPathHeadingEast.m
FindPathElevationsAndCost.m		FindPathElevationsAndCost.m
FindSmallestElevationChange.m		FindSmallestElevationChange.m
GreedyPick.m		GreedyPick.m
GreedyWalk.m		GreedyWalk.m
README.txt		README.txt
Reverse.m		Reverse.m

Repository files navigation

# BestGreedyPath
BestGreedyPath finds the best path moving from the western edge to the eastern edge 
This function is written in the MATLAB programming language 

BestGreedyPath finds the best path moving from the western edge to the
eastern edge. It calculates the possible costs for each path calculated by
the GreedyWalk function for each point in the elevation data and then
displays the pathRow and pathCol for the lowest costing path.
Inputs: elevationData - a n x m matrix representing the elevations
Outputs: pathRow - a 1D array containing row numbers for each of the
                   positions. 
         pathCol - a 1D array containing column numbers for each of the
                   positions.
         elevations - a 1D array containing the elevations of each of the
                    positions chosen from the elevationData.