|
-
May 10th, 2005, 06:49 AM
#1
Thread Starter
New Member
Distance Finder Program
http://www.wrestlefury.com/DataFiles.zip
The zip file contains a map, a spread sheet of distances between these towns and two files of data extracted from the spread sheet. The extracted data is a list of the towns and a table of distances. Both these files have the number of entries in the file on the first line. Click the following link to see a picture of the program:
http://www.wrestlefury.com/distancefinder.jpg
I was wondering if anyone can help with the coding, im a beginner and i think this is hard. I've created the Interface, just need to do the code. Any code or hints will be very appreciated.
-
May 10th, 2005, 08:17 AM
#2
Re: Distance Finder Program
The way the data is stored in the spreadsheet should give you a hint.
Fill a 2d array with the distances.
int[,] distances
public enum Towns
{
Cardiff,
Darby,
Leeds
}
int distance = distances[(int)Towns.Cardiff,(int)Towns.Darby];
Last edited by DeadEyes; May 10th, 2005 at 10:31 AM.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|