the best data structureThis is a discussion on the best data structure within the Programming Languages forums in category; Suppose you have a lot of different networks of cities where the same city can be a member of more than one network. What would be a superior data storage structure then a : typedef map<const city*, int > _Distance; typedef map<const city*, _Distance> Graph_t where city is data structure representing a city ?... | ||||||||
| | ||||||||
| ||||||||
| Register | FAQ | Calendar | Search | Today's Posts | Mark Forums Read |
|
#1
08-27-2008, 09:50 AM
| |||
| |||
 the best data structure Suppose you have a lot of different networks of cities where the same city can be a member of more than one network. What would be a superior data storage structure then a : typedef map<const city*, int > _Distance; typedef map<const city*, _Distance> Graph_t where city is data structure representing a city ?  |
|
#2
08-27-2008, 07:30 PM
| |||
| |||
| Re: the best data structure On Aug 27, 9:50*am, danijel.mand...@gmail.com wrote: > Suppose you have a lot of different networks of cities where the same > city can be a member of more than one network. What would be a > superior data storage structure then > a : > > typedef map<const city*, int > _Distance; > typedef map<const city*, _Distance> Graph_t > > where city is data structure representing a city ? You haven't provided enough information to answer the question. Data structures only have relative values in the context of the operations to be performed on them. Any data structures textbook will give you lots of insight on different graph representations, each of which makes most sense in a different context. |
 |
« Previous Thread
|
Next Thread »
| Thread Tools | |
| Display Modes | |
Linear Mode
All times are GMT -5. The time now is 04:38 PM.
