Programming Forums
User Name Password Register
 

RSS Feed
FORUM INDEX | TODAY'S POSTS | UNANSWERED THREADS | ADVANCED SEARCH

 
 
Thread Tools Display Modes
Prev Previous Post in Thread   Next Post in Thread Next
Old Oct 28th, 2005, 7:55 AM   #1
Silme
Newbie
 
Silme's Avatar
 
Join Date: Oct 2005
Posts: 7
Rep Power: 0 Silme is on a distinguished road
Send a message via MSN to Silme
Circularly Linked Lists

warm greetings,

I have this assignment due next Friday and i'm really strugling with solution.
I'm new to programming and this doesnt make it any easier.
The thing is that i have to read from file ( these file contain sting and two doubles) in a line. (City name and its coordinates - x and y).
I've done the part of reading from the file but now i have to store those values in circularly linked list. The first node has to be the lowest in alphabetical order from the city names in file. With the rest of them i need to compare the distance and print the shortest one (travelling salesman problem).
So i was just wondering if someone would be able to help me here.
Im not including any codes here cause im not sure which part of it would be useful.
I know that i have to create new node and then add it to the list but as i said im not familiar with it too much.
thank you.
Silme is offline   Reply With Quote
 

Bookmarks

« Previous Thread in Forum | Next Thread in Forum »

Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
 
Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump




DaniWeb IT Discussion Community
All times are GMT -5. The time now is 5:41 PM.

Powered by vBulletin® Version 3.7.0, Copyright ©2000 - 2008, Jelsoft Enterprises Ltd.
Copyright ©2007 DaniWeb® LLC