Show Bid Request
Shortest path
Bid Request Id: 36247
|
|
|
Posted by: |
Tonic (1 ratings)
(Software buyer rating 10)
|
Non-action Ratio: |
Very Good - 0.00%
|
Buyer Security Verifications: |
Good
|
Approved on: |
Nov 20, 2002 6:14:48 AM EDT
|
Bidding Closes: |
Nov 30, 2002 6:26:53 AM EDT
|
Viewed (by coders): |
149 times
|
|
|
|
Description:
I need function which will return does path form point A to point B exist. Point's are in grid/array (let's say 10x10). Grid can have blocks that are 'unwalkable'. Also, function should generate array with shortest path points coordinates. So, input is global array grid(10,10), startX, startY, endX, endY. Arrey values 0-'walkable' >0 'not walkable'. Note array is from 1-10, not from 0-9.
Function return 1 if path from (startX,startY) to (endX,endY) exist or 0 if path doesn't exist. Finction also write to array PATH all coordinates of shortest path from start to end point.
Deliverables: 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Complete ownership and distribution copyrights to all work purchased.
3) Function should be explained/documented
Platform:
Platform: Windows Language: Visual Basic
Classes are not allowed, only custom types.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
Name |
Bid Amount |
Date |
Coder Rating |
|
|
This bid was accepted by the buyer!
|
$10 (USD)
|
Nov 20, 2002 8:21:47 AM EDT
|
10
(Excellent)
|
|
|
Hello Tonic,
This reminds me of the college days. I would be glad to help you - my code samples following general coding conventions, are exceptionally well commented and relatively easy to follow. I don't know for sure, but from what I read in your bid request this could be very well a college assignment, and if so I must know if there are any other restrictions/requirements? For example: must be a recursive function or not. Do you want only one minimum path (in the case there are multiple choices)?
I don't see any problems getting this done in a couple of hours, based on what I've read so far.
Also if you are short on money and my bid is too high for you, please contact me via a private message and we'll talk :)
Meanwhile, if you have a moment, please review my online resume and client comments regarding my performance on their projects.
Good luck to you with your project and best regards,
Andrei B.
|
|
|
|
|
|