Path finding java project
- or -
Post a project like this2551
$$
- Posted:
- Proposals: 2
- Remote
- #1519660
- Awarded
Description
Experience Level: Intermediate
Expand the PathFindingOnSquaredGrid framework towards shortest path finding by
applying all three distance metrics as defined above, i.e., shortest path based on
Manhattan distance, shortest path based on Euclidean distance, shortest path based on
Chebyshev distance. Your implementation should switch over these three distance
metrics and produce, for each one, as output: a) visualisation of the shortest path on the
squared grid, b) the total cost of the shortest path depending on the applied distance
metric
applying all three distance metrics as defined above, i.e., shortest path based on
Manhattan distance, shortest path based on Euclidean distance, shortest path based on
Chebyshev distance. Your implementation should switch over these three distance
metrics and produce, for each one, as output: a) visualisation of the shortest path on the
squared grid, b) the total cost of the shortest path depending on the applied distance
metric
Queen M.
0% (0)Projects Completed
1
Freelancers worked with
1
Projects awarded
33%
Last project
4 Apr 2017
Sri Lanka
New Proposal
Login to your account and send a proposal now to get this project.
Log inClarification Board Ask a Question
-
There are no clarification messages.
We collect cookies to enable the proper functioning and security of our website, and to enhance your experience. By clicking on 'Accept All Cookies', you consent to the use of these cookies. You can change your 'Cookies Settings' at any time. For more information, please read ourCookie Policy
Cookie Settings
Accept All Cookies